YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> 0) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> undef6}> 1, arg2 -> 0, arg3 -> arg1}> 0) /\ ((arg2 - 1) < arg2) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> 0, arg3 -> 0}> 0) /\ ((arg2 - 1) < arg2), par{arg1 -> arg2, arg2 -> undef14, arg3 -> arg1}> 0) /\ ((arg2 - 1) < arg2) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> undef17, arg3 -> 0}> arg3, arg3 -> arg2}> 0), par{arg1 -> arg2, arg2 -> arg3, arg3 -> undef24}> 0) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> undef27}> 0), par{arg1 -> (arg1 - 1), arg3 -> undef30}> undef31, arg2 -> undef32, arg3 -> undef33}> Fresh variables: undef1, undef2, undef3, undef6, undef14, undef17, undef24, undef27, undef30, undef31, undef32, undef33, Undef variables: undef1, undef2, undef3, undef6, undef14, undef17, undef24, undef27, undef30, undef31, undef32, undef33, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef32 > 1) /\ (undef1 > ~(1)) /\ (undef31 > 0)> 0) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> undef6}> 0), par{arg1 -> 0, arg2 -> arg1, arg3 -> undef24}> 0) /\ ((arg2 - 1) < arg2) /\ (0 = arg1) /\ (arg2 > 0), par{arg1 -> 0, arg2 -> 0, arg3 -> undef24}> 0) /\ ((arg2 - 1) < arg2) /\ (arg2 > 0), par{arg1 -> undef14, arg2 -> arg1, arg3 -> undef24}> 0) /\ ((arg2 - 1) < arg2) /\ (0 = arg1) /\ (arg2 > 0), par{arg1 -> undef17, arg2 -> 0, arg3 -> undef24}> 0) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> undef27}> 0), par{arg1 -> (arg1 - 1), arg3 -> undef30}> Fresh variables: undef1, undef2, undef3, undef6, undef14, undef17, undef24, undef27, undef30, undef31, undef32, undef33, Undef variables: undef1, undef2, undef3, undef6, undef14, undef17, undef24, undef27, undef30, undef31, undef32, undef33, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg2, arg3 -> undef6, rest remain the same}> Variables: arg2, arg3 Graph 2: Transitions: -1 + arg2, arg3 -> undef27, rest remain the same}> -1 + arg1, arg3 -> undef30, rest remain the same}> Variables: arg2, arg3, arg1 Precedence: Graph 0 Graph 1 Graph 2 0, arg2 -> arg1, arg3 -> undef24, rest remain the same}> 0, arg2 -> 0, arg3 -> undef24, rest remain the same}> undef14, arg2 -> arg1, arg3 -> undef24, rest remain the same}> undef17, arg2 -> 0, arg3 -> undef24, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002322 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000603s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.004219 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001174s Ranking function: -1 + arg1 New Graphs: Transitions: -1 + arg2, arg3 -> undef27, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000556s Ranking function: -1 + arg2 New Graphs: Program Terminates