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.00/0.06 (0 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 undef30}> 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 (1 + i^0)}> 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0.00/0.06 0}> 0.00/0.06 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef30, undef82, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef30, undef82, 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.00/0.06 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 0}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 (1 + i^0)}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef30, undef82, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef30, undef82, 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 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 i^0 0.00/0.06 0.00/0.06 Graph 2: 0.00/0.06 Transitions: 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 1 + i^0, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 i^0 0.00/0.06 0.00/0.06 Graph 3: 0.00/0.06 Transitions: 0.00/0.06 Variables: 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 0.00/0.06 0.00/0.06 Graph 2 0.00/0.06 0, rest remain the same}> 0.00/0.06 0.00/0.06 Graph 3 0.00/0.06 0.00/0.06 0.00/0.06 Map Locations to Subgraph: 0.00/0.06 ( 0 , 0 ) 0.00/0.06 ( 2 , 2 ) 0.00/0.06 ( 7 , 1 ) 0.00/0.06 ( 12 , 3 ) 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.011425 0.00/0.06 0.00/0.06 Checking conditional termination of SCC {l7}... 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.002028s 0.00/0.06 Ranking function: 999 - i^0 0.00/0.06 New Graphs: 0.00/0.06 Proving termination of subgraph 2 0.00/0.06 Checking unfeasibility... 0.00/0.06 Time used: 0.009396 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.002127s 0.00/0.06 Ranking function: 999 - i^0 0.00/0.06 New Graphs: 0.00/0.06 Proving termination of subgraph 3 0.00/0.06 Analyzing SCC {l12}... 0.00/0.06 No cycles found. 0.00/0.06 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.06 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.06 EOF