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 0) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef3}> 0.00/0.03 arg2) /\ (arg1 > 1) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> undef6}> 0.00/0.03 1), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef9}> 0.00/0.03 1) /\ (undef11 > 3) /\ (arg1 < 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 0.00/0.03 1) /\ (arg2 > 0) /\ (undef13 > 1) /\ (undef14 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((undef15 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.03 undef16, arg2 -> undef17, arg3 -> undef18}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 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 0) /\ (undef1 > ~(1)) /\ (undef16 > 0)> 0.00/0.03 arg2) /\ (arg1 > 1) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> undef6}> 0.00/0.03 1), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef9}> 0.00/0.03 1) /\ (undef11 > 3) /\ (arg1 < 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 0.00/0.03 1) /\ (arg2 > 0) /\ (undef13 > 1) /\ (undef14 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((undef15 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 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 -> undef5, arg3 -> undef6, rest remain the same}> 0.00/0.03 -1 + arg1, arg2 -> 1, arg3 -> undef9, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 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 Graph 2 0.00/0.03 undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> 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 ( 3 , 2 ) 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.005707 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.001351s 0.00/0.03 Ranking function: -2 + arg1 0.00/0.03 New Graphs: 0.00/0.03 Proving termination of subgraph 2 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.003064 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l3}... 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.001487s 0.00/0.03 Ranking function: -1 + arg2 0.00/0.03 New Graphs: 0.00/0.03 Program Terminates 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.04 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.04 EOF