YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1, oldX1^0 -> undef2, oldX2^0 -> undef3, x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> undef10, oldX1^0 -> undef11, oldX2^0 -> undef12, x0^0 -> (0 + undef10), x1^0 -> (0 + undef11), x2^0 -> (0 + undef12)}> undef19, oldX1^0 -> undef20, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef22, x0^0 -> (0 + undef19), x1^0 -> (1 + undef20), x2^0 -> (0 + undef22)}> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, oldX3^0 -> undef31, oldX4^0 -> undef32, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> undef37, oldX1^0 -> undef38, oldX2^0 -> undef39, oldX3^0 -> undef40, oldX4^0 -> undef41, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef49, oldX4^0 -> undef50, oldX5^0 -> undef51, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> undef55, oldX1^0 -> undef56, oldX2^0 -> undef57, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef57)}> undef64, oldX1^0 -> undef65, oldX2^0 -> undef66, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef66)}> undef73, oldX1^0 -> undef74, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef76, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef76)}> undef82, oldX1^0 -> undef83, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> undef91, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef94, x0^0 -> (0 + undef91), x1^0 -> 1, x2^0 -> (0 + undef94)}> undef100, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef103, oldX4^0 -> undef104, x0^0 -> (0 + undef100), x1^0 -> (0 + undef103), x2^0 -> (0 + undef104)}> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, Undef variables: undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, Undef variables: undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> Variables: x0^0, x1^0, x2^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}> Graph 2 undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006688 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003109s Ranking function: -2 + x0^0 - x1^0 New Graphs: Transitions: undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}> Variables: x0^0, x1^0, x2^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001721s Ranking function: -1 + x0^0 - x1^0 - x2^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l8}... No cycles found. Program Terminates