0.00/0.03 YES 0.00/0.03 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0.00/0.04 0.00/0.04 (0 + undef10), ___cil_tmp4_8^0 -> undef10, ___retres3_7^0 -> undef12}> 0.00/0.04 ((0 + d_6^0) + i_5^0)}> 0.00/0.04 0.00/0.04 (0 + undef31), ___cil_tmp4_8^0 -> undef31, ___retres3_7^0 -> undef33}> 0.00/0.04 0.00/0.04 (0 + undef44), ___cil_tmp2_10^0 -> undef44, ___retres1_9^0 -> undef46}> 0.00/0.04 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 ((0 + d_6^0) + i_5^0)}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 d_6^0 + i_5^0, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 d_6^0, i_5^0 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 3 , 1 ) 0.00/0.04 ( 6 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.002254 0.00/0.04 0.00/0.04 Checking conditional termination of SCC {l3}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.000845s 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.001387s 0.00/0.04 Trying to remove transition: d_6^0 + i_5^0, rest remain the same}> 0.00/0.04 Solving with 1 template(s). 0.00/0.04 0.00/0.04 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.04 0.00/0.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004184s 0.00/0.04 Time used: 0.004063 0.00/0.04 Solving with 1 template(s). 0.00/0.04 0.00/0.04 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.04 0.00/0.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005627s 0.00/0.04 Time used: 0.005373 0.00/0.04 0.00/0.04 LOG: SAT solveNonLinear - Elapsed time: 0.005627s 0.00/0.04 Cost: 0; Total time: 0.005373 0.00/0.04 Termination implied by a set of invariant(s): 0.00/0.04 Invariant at l3: 1 + d_6^0 <= 0 0.00/0.04 [ Invariant Graph ] 0.00/0.04 Strengthening and disabling transitions... 0.00/0.04 0.00/0.04 LOG: CALL solverLinear in Graph for feasibility 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.04 Strengthening transition (result): 0.00/0.04 d_6^0 + i_5^0, rest remain the same}> 0.00/0.04 [ Termination Graph ] 0.00/0.04 Strengthening and disabling transitions... 0.00/0.04 0.00/0.04 LOG: CALL solverLinear in Graph for feasibility 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.04 Strengthening transition (result): 0.00/0.04 d_6^0 + i_5^0, rest remain the same}> 0.00/0.04 Ranking function: i_5^0 0.00/0.04 New Graphs: 0.00/0.04 INVARIANTS: 0.00/0.04 3: 1 + d_6^0 <= 0 , 0.00/0.04 Quasi-INVARIANTS to narrow Graph: 0.00/0.04 3: 0.00/0.04 Proving termination of subgraph 2 0.00/0.04 Analyzing SCC {l6}... 0.00/0.04 No cycles found. 0.00/0.04 0.00/0.04 Program Terminates 0.00/0.04 /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