YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef5, oldX3^0 -> undef6, x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}> undef11, oldX1^0 -> undef12, x0^0 -> (0 + undef11), x1^0 -> (~(1) + undef12)}> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}> undef27, oldX1^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}> undef35, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef37, x0^0 -> (~(1) + undef35), x1^0 -> (0 + undef37)}> undef43, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef43), x1^0 -> (0 + __const_7^0)}> undef51, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef53, x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef61, x0^0 -> (0 + __const_7^0), x1^0 -> (0 + undef61)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef69, oldX3^0 -> undef70, x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}> undef75, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef77, x0^0 -> (1 + undef75), x1^0 -> (0 + undef77)}> undef83, oldX1^0 -> undef84, x0^0 -> (0 + undef83), x1^0 -> (0 + undef84)}> undef91, oldX1^0 -> undef92, x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), x0^0 -> 0, x1^0 -> 0}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef109, oldX3^0 -> undef110, x0^0 -> (0 + undef109), x1^0 -> (0 + undef110)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef117, oldX3^0 -> undef118, x0^0 -> (0 + undef117), x1^0 -> (0 + undef118)}> Fresh variables: undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, Undef variables: undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef69), x1^0 -> (0 + undef70)}> (0 + undef91), x1^0 -> (0 + undef92)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef51), x1^0 -> (0 + undef53)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef51), x1^0 -> (0 + undef53)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef51), x1^0 -> (0 + undef53)}> (0 + undef69), x1^0 -> (0 + undef70)}> (0 + undef69), x1^0 -> (0 + undef70)}> (0 + undef91), x1^0 -> (0 + undef92)}> (0 + undef69), x1^0 -> (0 + undef70)}> (0 + undef91), x1^0 -> (0 + undef92)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef5), x1^0 -> (0 + undef6)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef51), x1^0 -> (0 + undef53)}> (0 + undef69), x1^0 -> (0 + undef70)}> (0 + undef91), x1^0 -> (0 + undef92)}> Fresh variables: undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, Undef variables: undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef51, x1^0 -> undef53, rest remain the same}> Variables: x0^0, x1^0 Graph 2: Transitions: undef27, x1^0 -> undef28, rest remain the same}> Variables: x0^0, x1^0 Graph 3: Transitions: Variables: Graph 4: Transitions: undef91, x1^0 -> undef92, rest remain the same}> Variables: __const_63^0, x0^0, x1^0 Graph 5: Transitions: Variables: Precedence: Graph 0 Graph 1 undef51, x1^0 -> undef53, rest remain the same}> undef51, x1^0 -> undef53, rest remain the same}> undef51, x1^0 -> undef53, rest remain the same}> Graph 2 undef27, x1^0 -> undef28, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> Graph 3 undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> undef5, x1^0 -> undef6, rest remain the same}> Graph 4 undef91, x1^0 -> undef92, rest remain the same}> undef91, x1^0 -> undef92, rest remain the same}> undef91, x1^0 -> undef92, rest remain the same}> Graph 5 undef69, x1^0 -> undef70, rest remain the same}> undef69, x1^0 -> undef70, rest remain the same}> undef69, x1^0 -> undef70, rest remain the same}> undef69, x1^0 -> undef70, rest remain the same}> undef69, x1^0 -> undef70, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 3 ) ( 3 , 2 ) ( 5 , 1 ) ( 9 , 5 ) ( 10 , 4 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002296 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000921s Ranking function: -1 + x0^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002768 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001135s Ranking function: -1 + x1^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l2}... No cycles found. Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.002618 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001215s Ranking function: -1 + __const_63^0 - x0^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l9}... No cycles found. Program Terminates