0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0.00/0.03 ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0.00/0.03 0) /\ (arg1 > ~(1)) /\ ((arg1 + 1) > arg1) /\ ((arg2 - 1) < arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 1)}> 0.00/0.03 2) /\ ((arg1 - 2) < arg1) /\ (0 = arg2), par{arg1 -> (arg1 - 2), arg2 -> 1}> 0.00/0.03 undef7, arg2 -> undef8}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef7, undef8, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef7, undef8, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 ~(1)) /\ (undef8 > 1) /\ (undef2 > ~(1)) /\ (undef7 > 0)> 0.00/0.03 0) /\ (arg1 > ~(1)) /\ ((arg1 + 1) > arg1) /\ ((arg2 - 1) < arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 1)}> 0.00/0.03 2) /\ ((arg1 - 2) < arg1) /\ (0 = arg2), par{arg1 -> (arg1 - 2), arg2 -> 1}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef7, undef8, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef7, undef8, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 0.00/0.03 -2 + arg1, arg2 -> 1, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.004953 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.001127s 0.00/0.03 Ranking function: -2 + arg1 + 2*arg2 0.00/0.03 New Graphs: 0.00/0.03 Transitions: 0.00/0.03 -2 + arg1, arg2 -> 1, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000595s 0.00/0.03 Ranking function: -arg2 0.00/0.03 New Graphs: 0.00/0.03 Program Terminates 0.00/0.03 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.03 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.03 EOF