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