0.00/0.02 YES 0.00/0.02 0.00/0.02 Solver Timeout: 4 0.00/0.02 Global Timeout: 300 0.00/0.02 No parsing errors! 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 0.00/0.02 undef5, ret_fib9^0 -> undef8, tmp^0 -> (0 + undef8)}> 0.00/0.02 ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0), temp7^0 -> undef19}> 0.00/0.02 0.00/0.02 1, Fold6^0 -> 0, a^0 -> undef34, i4^0 -> 2, n3^0 -> (0 + undef34)}> 0.00/0.02 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 Preprocessed LLVMGraph 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 0.00/0.02 0.00/0.02 ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0)}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 ************************************************************* 0.00/0.02 ******************************************************************************************* 0.00/0.02 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Init Location: 0 0.00/0.02 Graph 0: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Graph 1: 0.00/0.02 Transitions: 0.00/0.02 Fnew5^0 + Fold6^0, Fold6^0 -> undef19, i4^0 -> 1 + i4^0, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 Fnew5^0, Fold6^0, i4^0, n3^0 0.00/0.02 0.00/0.02 Graph 2: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Precedence: 0.00/0.02 Graph 0 0.00/0.02 0.00/0.02 Graph 1 0.00/0.02 0.00/0.02 0.00/0.02 Graph 2 0.00/0.02 0.00/0.02 0.00/0.02 Map Locations to Subgraph: 0.00/0.02 ( 0 , 0 ) 0.00/0.02 ( 2 , 2 ) 0.00/0.02 ( 3 , 1 ) 0.00/0.02 0.00/0.02 ******************************************************************************************* 0.00/0.02 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Proving termination of subgraph 0 0.00/0.02 Proving termination of subgraph 1 0.00/0.02 Checking unfeasibility... 0.00/0.02 Time used: 0.003361 0.00/0.02 0.00/0.02 Checking conditional termination of SCC {l3}... 0.00/0.02 0.00/0.02 LOG: CALL solveLinear 0.00/0.02 0.00/0.02 LOG: RETURN solveLinear - Elapsed time: 0.001167s 0.00/0.02 Ranking function: -i4^0 + n3^0 0.00/0.02 New Graphs: 0.00/0.02 Proving termination of subgraph 2 0.00/0.02 Analyzing SCC {l2}... 0.00/0.02 No cycles found. 0.00/0.02 0.00/0.02 Program Terminates 0.00/0.02 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.03 EOF