YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef31}> (0 + cword25^0)}> undef72, j24^0 -> (1 + j24^0)}> undef125}> undef157}> undef264}> 1}> undef360}> (1 + i1128^0)}> undef418}> undef450}> (1 + j24^0), ret_icrc11330^0 -> (0 + ans1229^0)}> undef611, crc926^0 -> undef615, i1128^0 -> 0, onech1027^0 -> 0}> 1, j24^0 -> 0}> undef772, cword25^0 -> (0 + undef772), i1^0 -> undef780, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0), ret_icrc17^0 -> undef796}> undef865}> (0 + cword11^0)}> undef904, j10^0 -> (1 + j10^0)}> undef959}> undef991}> undef1096}> 1}> undef1224}> (1 + i1114^0)}> undef1314}> undef1346}> (1 + j10^0), ret_icrc11316^0 -> (0 + ans1215^0)}> undef1507, crc912^0 -> undef1511, i1114^0 -> 0, onech1013^0 -> 0}> 1, j10^0 -> 0}> (0 + undef1662), ret_icrc31^0 -> undef1662}> undef1670, cword11^0 -> (0 + undef1670), jinit6^0 -> 0, jrev7^0 -> 1, len5^0 -> (0 + undef1688), n^0 -> undef1688}> Fresh variables: undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, Undef variables: undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1224, j10^0 -> 1}> undef1224, j10^0 -> 1}> undef1507, cword11^0 -> (0 + undef1670), i1114^0 -> 0, init^0 -> 1, j10^0 -> 0}> undef72, j24^0 -> (1 + j24^0)}> undef72, j24^0 -> (1 + j24^0)}> 1}> undef264, j24^0 -> 1}> undef360, j24^0 -> 1}> undef611, i1128^0 -> 0, j24^0 -> (1 + j24^0)}> undef418, i1128^0 -> (1 + i1128^0)}> undef450, i1128^0 -> (1 + i1128^0)}> undef1224, j10^0 -> 1}> undef1507, i1114^0 -> 0, j10^0 -> (1 + j10^0)}> undef1314, i1114^0 -> (1 + i1114^0)}> undef1346, i1114^0 -> (1 + i1114^0)}> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef611, cword25^0 -> (0 + undef772), i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef904, j10^0 -> (1 + j10^0)}> Fresh variables: undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, Undef variables: undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1507, i1114^0 -> 0, j10^0 -> 1 + j10^0, rest remain the same}> undef1314, i1114^0 -> 1 + i1114^0, rest remain the same}> undef1346, i1114^0 -> 1 + i1114^0, rest remain the same}> Variables: ans1215^0, i1114^0, j10^0 Graph 2: Transitions: undef904, j10^0 -> 1 + j10^0, rest remain the same}> Variables: cword11^0, j10^0, len5^0 Graph 3: Transitions: undef611, i1128^0 -> 0, j24^0 -> 1 + j24^0, rest remain the same}> undef418, i1128^0 -> 1 + i1128^0, rest remain the same}> undef450, i1128^0 -> 1 + i1128^0, rest remain the same}> Variables: ans1229^0, i1128^0, j24^0 Graph 4: Transitions: undef72, j24^0 -> 1 + j24^0, rest remain the same}> undef72, j24^0 -> 1 + j24^0, rest remain the same}> Variables: cword25^0, j24^0, jrev21^0, len19^0 Graph 5: Transitions: Variables: Precedence: Graph 0 Graph 1 undef1507, cword11^0 -> undef1670, i1114^0 -> 0, init^0 -> 1, j10^0 -> 0, rest remain the same}> Graph 2 undef1224, j10^0 -> 1, rest remain the same}> undef1224, j10^0 -> 1, rest remain the same}> undef1224, j10^0 -> 1, rest remain the same}> Graph 3 undef611, cword25^0 -> undef772, i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> Graph 4 1, rest remain the same}> undef264, j24^0 -> 1, rest remain the same}> undef360, j24^0 -> 1, rest remain the same}> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> Graph 5 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 4 ) ( 11 , 3 ) ( 19 , 1 ) ( 22 , 2 ) ( 33 , 5 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.008479 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001348s Ranking function: 254 - j10^0 New Graphs: Transitions: undef1314, i1114^0 -> 1 + i1114^0, rest remain the same}> undef1346, i1114^0 -> 1 + i1114^0, rest remain the same}> Variables: ans1215^0, i1114^0 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000700s Ranking function: 7 - i1114^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001352 Checking conditional termination of SCC {l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s Ranking function: -j10^0 + len5^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.008827 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001331s Ranking function: 254 - j24^0 New Graphs: Transitions: undef418, i1128^0 -> 1 + i1128^0, rest remain the same}> undef450, i1128^0 -> 1 + i1128^0, rest remain the same}> Variables: ans1229^0, i1128^0 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000728s Ranking function: 7 - i1128^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.00314 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001509s Ranking function: -2 - j24^0 - 2*jrev21^0 + len19^0 New Graphs: Transitions: undef72, j24^0 -> 1 + j24^0, rest remain the same}> Variables: cword25^0, j24^0, jrev21^0, len19^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000833s Ranking function: -j24^0 + len19^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l33}... No cycles found. Program Terminates