NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0, arg2 -> undef2}> 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}> undef6}> 49), par{arg2 -> undef8}> 0}> (arg2 + 1)}> 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}> undef15, arg2 -> undef16}> Fresh variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}> 49), par{arg2 -> undef8}> 0}> undef6}> (arg2 + 1)}> 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}> Fresh variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> undef4, rest remain the same}> 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: undef6, rest remain the same}> Variables: arg2 Precedence: Graph 0 Graph 1 Graph 2 undef8, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.327562 Checking conditional termination of SCC {l2, l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004045s Ranking function: 49 - arg1 New Graphs: Transitions: 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2, l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001008s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004643s Trying to remove transition: 1 + arg1, arg2 -> undef14, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011339s Time used: 0.011162 Trying to remove transition: 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021787s Time used: 0.021131 Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008223s Time used: 0.007171 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072029s Time used: 0.071481 LOG: SAT solveNonLinear - Elapsed time: 0.072029s Cost: 0; Total time: 0.071481 Termination implied by a set of invariant(s): Invariant at l4: arg1 <= 9 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> Ranking function: 9 - arg1 New Graphs: Transitions: 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000783s Ranking function: 14 - arg2 New Graphs: INVARIANTS: 4: arg1 <= 9 , Quasi-INVARIANTS to narrow Graph: 4: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001376 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000501s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001171s Trying to remove transition: undef6, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002762s Time used: 0.002656 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003714s Time used: 0.003545 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003975s Time used: 4.00355 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.037561s Time used: 1.00063 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007225s Time used: 0.003706 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef8, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef8, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000538s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000614s LOG: NarrowEntry size 1 Narrowing transition: 1 + arg1, arg2 -> undef4, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, arg2 -> undef14, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + arg1, arg2 -> undef4, rest remain the same}> 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> END GRAPH: EXIT: undef8, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.662792s Time used: 0.662632 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005571s Time used: 4.00125 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020718s Time used: 1.0016 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.707075s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: undef6, rest remain the same}> Variables: arg2 Checking conditional non-termination of SCC {l3}... > No exit transition to close. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef8, rest remain the same}> Conditions: OPEN EXITS: undef8, rest remain the same}> --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 50 <= arg1, arg1 <= 99, OPEN EXITS: > Conditions are not feasible after transitions. --- Reachability graph --- Transitions: 1 + arg1, arg2 -> undef4, rest remain the same}> Variables: arg1, arg2 Checking edge-closing of SCC {l2}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030853s Time used: 0.030636 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020048s Time used: 0.020041 LOG: SAT solveNonLinear - Elapsed time: 0.050901s Cost: 1; Total time: 0.050677 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.008071s Number of undef constraints reduced! Edge-closing implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 50 Strengthening and disabling EXIT transitions... EXIT TRANSITIONS TO BE CLOSED: Closed exits from l2: 1 Strengthening exit transition (result): EXIT TRANSITIONS TO KEEP OPEN: Strengthening exit transition (result): undef8, rest remain the same}> Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef4, rest remain the same}> Checking edge-closing of SCC {l2}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006935s Time used: 0.006834 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.040453s Time used: 5.03966 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.013207s Time used: 5.00103 > No quasi-invariants that block all exits have been found. --- Reachability graph --- Transitions: 1 + arg1, arg2 -> undef14, rest remain the same}> 0, rest remain the same}> Variables: arg1, arg2 Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059345s Time used: 0.059092 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045970s Time used: 0.045961 LOG: SAT solveNonLinear - Elapsed time: 0.105314s Cost: 3; Total time: 0.105053 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.011270s Number of undef constraints reduced! Edge-closing implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 50 Quasi-invariant at l4: arg1 + arg2 <= 15 Strengthening and disabling EXIT transitions... EXIT TRANSITIONS TO BE CLOSED: Closed exits from l2: 1 Strengthening exit transition (result): Strengthening exit transition (result): EXIT TRANSITIONS TO KEEP OPEN: Strengthening exit transition (result): undef8, rest remain the same}> Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, 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}> Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037181s Time used: 0.037068 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003200s Time used: 5.00087 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.010941s Time used: 5.001 > No quasi-invariants that block all exits have been found. --- Reachability graph --- Transitions: 1 + arg1, arg2 -> undef14, rest remain the same}> 0, rest remain the same}> 1 + arg1, arg2 -> undef4, rest remain the same}> Variables: arg1, arg2 Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084815s Time used: 0.084513 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.126102s Time used: 0.126089 LOG: SAT solveNonLinear - Elapsed time: 0.210917s Cost: 1; Total time: 0.210602 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.017541s Number of undef constraints reduced! Edge-closing implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 50 Quasi-invariant at l4: arg1 <= 9 Strengthening and disabling EXIT transitions... EXIT TRANSITIONS TO BE CLOSED: Closed exits from l2: 1 Strengthening exit transition (result): EXIT TRANSITIONS TO KEEP OPEN: Strengthening exit transition (result): undef8, rest remain the same}> Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, 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 Strengthening transition (result): 1 + arg1, arg2 -> undef4, rest remain the same}> Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025760s Time used: 0.025655 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002299s Time used: 5.00102 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.012998s Time used: 5.00144 > No quasi-invariants that block all exits have been found. --- Reachability graph --- Transitions: 1 + arg1, arg2 -> undef14, rest remain the same}> 1 + arg2, rest remain the same}> 0, rest remain the same}> Variables: arg1, arg2 Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077356s Time used: 0.077079 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043835s Time used: 0.043827 LOG: SAT solveNonLinear - Elapsed time: 0.121191s Cost: 1; Total time: 0.120906 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.013033s Number of undef constraints reduced! Edge-closing implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 50 Quasi-invariant at l4: arg1 <= 14 Strengthening and disabling EXIT transitions... EXIT TRANSITIONS TO BE CLOSED: Closed exits from l2: 1 Strengthening exit transition (result): EXIT TRANSITIONS TO KEEP OPEN: Strengthening exit transition (result): undef8, rest remain the same}> Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, 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}> Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032587s Time used: 0.032482 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004478s Time used: 5.00181 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.012824s Time used: 5.00123 > No quasi-invariants that block all exits have been found. --- Reachability graph --- Transitions: 1 + arg1, arg2 -> undef14, rest remain the same}> 1 + arg2, rest remain the same}> 0, rest remain the same}> 1 + arg1, arg2 -> undef4, rest remain the same}> Variables: arg1, arg2 Checking edge-closing of SCC {l2, l4}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093611s Time used: 0.093494 LOG: SAT solveNonLinear - Elapsed time: 0.093611s Cost: 0; Total time: 0.093494 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.010803s Number of undef constraints reduced! Edge-closing implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 50 Quasi-invariant at l4: arg1 <= 15 Strengthening and disabling EXIT transitions... EXIT TRANSITIONS TO BE CLOSED: Closed exits from l2: 1 EXIT TRANSITIONS TO KEEP OPEN: Strengthening exit transition (result): undef8, rest remain the same}> Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, 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 Strengthening transition (result): 1 + arg1, arg2 -> undef4, rest remain the same}> Checking conditional termination of SCC {l2, l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002583s Ranking function: 49 - arg1 New Graphs: Transitions: 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001317s Ranking function: 14 - arg2 New Graphs: Calling reachability with... Transition: Conditions: arg1 <= 50, OPEN EXITS: > Conditions are reachable! Program does NOT terminate