0.00/0.06 YES 0.00/0.06 0.00/0.06 Solver Timeout: 4 0.00/0.06 Global Timeout: 300 0.00/0.06 No parsing errors! 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 0.00/0.06 0) /\ (0 = arg2), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.06 ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> arg2, arg4 -> 1}> 0.00/0.06 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0.00/0.06 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> 0.00/0.06 undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> undef21}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 Preprocessed LLVMGraph 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 0) /\ (0 = undef19), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.06 ~(1)) /\ (undef19 > 0) /\ (undef18 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> undef19, arg4 -> 1}> 0.00/0.06 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0.00/0.06 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 ************************************************************* 0.00/0.06 ******************************************************************************************* 0.00/0.06 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Init Location: 0 0.00/0.06 Graph 0: 0.00/0.06 Transitions: 0.00/0.06 Variables: 0.00/0.06 0.00/0.06 Graph 1: 0.00/0.06 Transitions: 0.00/0.06 -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 arg1, arg2, arg3, arg4 0.00/0.06 0.00/0.06 Precedence: 0.00/0.06 Graph 0 0.00/0.06 0.00/0.06 Graph 1 0.00/0.06 -1, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> 0.00/0.06 -1 + 3*undef9, arg2 -> 3*undef9, arg3 -> undef19, arg4 -> 1, rest remain the same}> 0.00/0.06 0.00/0.06 Map Locations to Subgraph: 0.00/0.06 ( 0 , 0 ) 0.00/0.06 ( 2 , 1 ) 0.00/0.06 0.00/0.06 ******************************************************************************************* 0.00/0.06 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Proving termination of subgraph 0 0.00/0.06 Proving termination of subgraph 1 0.00/0.06 Checking unfeasibility... 0.00/0.06 Time used: 0.007671 0.00/0.06 0.00/0.06 Checking conditional termination of SCC {l2}... 0.00/0.06 0.00/0.06 LOG: CALL solveLinear 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear - Elapsed time: 0.001654s 0.00/0.06 Ranking function: arg3 - arg4 0.00/0.06 New Graphs: 0.00/0.06 Transitions: 0.00/0.06 -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 arg1, arg2, arg3, arg4 0.00/0.06 Checking conditional termination of SCC {l2}... 0.00/0.06 0.00/0.06 LOG: CALL solveLinear 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear - Elapsed time: 0.000630s 0.00/0.06 0.00/0.06 LOG: CALL solveLinear 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear - Elapsed time: 0.002411s 0.00/0.06 Trying to remove transition: -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 Solving with 1 template(s). 0.00/0.06 0.00/0.06 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.06 0.00/0.06 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009781s 0.00/0.06 Time used: 0.009615 0.00/0.06 Solving with 1 template(s). 0.00/0.06 0.00/0.06 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.06 0.00/0.06 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015833s 0.00/0.06 Time used: 0.015342 0.00/0.06 0.00/0.06 LOG: SAT solveNonLinear - Elapsed time: 0.015833s 0.00/0.06 Cost: 0; Total time: 0.015342 0.00/0.06 Termination implied by a set of invariant(s): 0.00/0.06 Invariant at l2: arg2 <= 1 + arg1 0.00/0.06 [ Invariant Graph ] 0.00/0.06 Strengthening and disabling transitions... 0.00/0.06 0.00/0.06 LOG: CALL solverLinear in Graph for feasibility 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.06 Strengthening transition (result): 0.00/0.06 -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 0.00/0.06 LOG: CALL solverLinear in Graph for feasibility 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.06 Strengthening transition (result): 0.00/0.06 -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.06 [ Termination Graph ] 0.00/0.06 Strengthening and disabling transitions... 0.00/0.06 0.00/0.06 LOG: CALL solverLinear in Graph for feasibility 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.06 Strengthening transition (result): 0.00/0.06 -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 Ranking function: arg1 0.00/0.06 New Graphs: 0.00/0.06 INVARIANTS: 0.00/0.06 2: arg2 <= 1 + arg1 , 0.00/0.06 Quasi-INVARIANTS to narrow Graph: 0.00/0.06 2: 0.00/0.06 Program Terminates 0.00/0.06 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.07 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.07 EOF