NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (~(1) + j^0), temp^0 -> undef9}> (1 + i^0)}> (0 + i^0)}> 2}> Fresh variables: undef9, Undef variables: undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + 2)}> (~(1) + j^0)}> (1 + i^0)}> (1 + i^0), j^0 -> (0 + (1 + i^0))}> Fresh variables: undef9, Undef variables: undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}> Variables: j^0, i^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 2, rest remain the same}> Graph 2 1 + i^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00781 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000972s Ranking function: 9 - i^0 New Graphs: Transitions: -1 + j^0, rest remain the same}> Variables: j^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000423s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s Trying to remove transition: -1 + j^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002869s Time used: 0.002759 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008285s Time used: 0.008092 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001046s Time used: 4.00049 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016210s Time used: 1.00924 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014619s Time used: 0.00912 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019313s Time used: 0.019306 LOG: SAT solveNonLinear - Elapsed time: 0.033932s Cost: 1; Total time: 0.028426 Termination implied by a set of invariant(s): Invariant at l3: 1 <= i^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, j^0 -> 1 + i^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j^0, rest remain the same}> Quasi-ranking function: 50000 + j^0 New Graphs: Transitions: -1 + j^0, rest remain the same}> Variables: j^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000493s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001664s Trying to remove transition: -1 + j^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003955s Time used: 0.003819 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001096s Time used: 4.00074 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.046770s Time used: 4.00087 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007120s Time used: 1.00055 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007834s Time used: 4.00197 Termination failed. Trying to show unreachability... Proving unreachability of entry: 2, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 2, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046583s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.046698s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: -1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}> Variables: j^0, i^0 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: 2, rest remain the same}> Conditions: OPEN EXITS: 2, rest remain the same}> > Conditions are reachable! Program does NOT terminate