/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> arg1, arg3 -> arg1}> 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> undef8, arg3 -> undef9}> 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg3 -> arg2}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> undef80, arg3 -> undef81}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef83, arg3 -> undef84}> undef85, arg2 -> undef86, arg3 -> undef87}> Fresh variables: undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, Undef variables: undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef86 > ~(1))> 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1), arg3 -> (arg1 - 1)}> 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg3 -> arg2}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> arg1, arg3 -> arg1}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> undef80, arg3 -> undef81}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef83, arg3 -> undef84}> Fresh variables: undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, Undef variables: undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> -1 + arg1, arg3 -> -1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 3: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 4: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 5: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 6: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 7: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 8: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 9: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 10: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 11: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 12: Transitions: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg2, arg3 Graph 13: Transitions: -1 + arg1, arg2 -> undef83, arg3 -> undef84, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Graph 2 arg2, arg3 -> arg2, rest remain the same}> Graph 3 arg1, arg3 -> arg1, rest remain the same}> Graph 4 arg1, arg3 -> arg1, rest remain the same}> Graph 5 arg1, arg3 -> arg1, rest remain the same}> Graph 6 arg1, arg3 -> arg1, rest remain the same}> Graph 7 arg1, arg3 -> arg1, rest remain the same}> Graph 8 arg1, arg3 -> arg1, rest remain the same}> Graph 9 arg1, arg3 -> arg1, rest remain the same}> Graph 10 arg1, arg3 -> arg1, rest remain the same}> Graph 11 arg1, arg3 -> arg1, rest remain the same}> Graph 12 arg1, arg3 -> arg1, rest remain the same}> Graph 13 undef80, arg3 -> undef81, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 4 , 2 ) ( 5 , 3 ) ( 6 , 4 ) ( 7 , 5 ) ( 8 , 6 ) ( 9 , 7 ) ( 10 , 8 ) ( 11 , 9 ) ( 12 , 10 ) ( 13 , 11 ) ( 14 , 12 ) ( 15 , 13 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007288 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001549s Ranking function: -297 + 297*arg1 + arg2 - arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000740s Ranking function: 99 - arg2 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002447 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000736s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.001894 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000770s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.001909 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000775s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 5 Checking unfeasibility... Time used: 0.001919 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000787s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 6 Checking unfeasibility... Time used: 0.001913 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000800s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 7 Checking unfeasibility... Time used: 0.001928 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000809s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 8 Checking unfeasibility... Time used: 0.001932 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000842s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 9 Checking unfeasibility... Time used: 0.001923 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000854s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 10 Checking unfeasibility... Time used: 0.001939 Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000864s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 11 Checking unfeasibility... Time used: 0.001942 Checking conditional termination of SCC {l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000869s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 12 Checking unfeasibility... Time used: 0.001936 Checking conditional termination of SCC {l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000883s Ranking function: -1 + arg2 New Graphs: Proving termination of subgraph 13 Checking unfeasibility... Time used: 0.002067 Checking conditional termination of SCC {l15}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000866s Ranking function: -1 + arg1 New Graphs: Program Terminates