YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> undef7, oldX1^0 -> undef8, x0^0 -> (~(1) + undef7), x1^0 -> (~(1) + undef8)}> undef13, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef15, oldX3^0 -> undef16, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}> undef19, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> undef25, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef27, oldX3^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}> undef31, oldX1^0 -> undef32, x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}> undef37, oldX1^0 -> undef38, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38)}> undef43, oldX1^0 -> undef44, x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}> Fresh variables: undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, Undef variables: undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef31), x1^0 -> (0 + undef32)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef31), x1^0 -> (0 + undef32)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef3), x1^0 -> (0 + undef4)}> (0 + undef31), x1^0 -> (0 + undef32)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef27), x1^0 -> (0 + undef28)}> Fresh variables: undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, Undef variables: undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef31, x1^0 -> undef32, rest remain the same}> Variables: x0^0, x1^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef31, x1^0 -> undef32, rest remain the same}> undef31, x1^0 -> undef32, rest remain the same}> Graph 2 undef15, x1^0 -> undef16, rest remain the same}> undef21, x1^0 -> undef22, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef21, x1^0 -> undef22, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef21, x1^0 -> undef22, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef3, x1^0 -> undef4, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef21, x1^0 -> undef22, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001372 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000647s Ranking function: -2 + x0^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l2}... No cycles found. Program Terminates