0.79/0.86 YES 0.79/0.86 0.79/0.87 Solver Timeout: 4 0.79/0.87 Global Timeout: 300 0.79/0.87 No parsing errors! 0.79/0.87 Init Location: 0 0.79/0.87 Transitions: 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 (1 + j^0)}> 0.79/0.87 0.79/0.87 (1 + i^0)}> 0.79/0.87 undef57}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 undef167, k^0 -> (1 + k^0)}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 (1 + i^0)}> 0.79/0.87 0.79/0.87 (0 + dum^0), imax^0 -> (0 + i^0)}> 0.79/0.87 0.79/0.87 undef255, tmp___0^0 -> undef264}> 0.79/0.87 (1 + k^0), sum^0 -> undef272}> 0.79/0.87 0.79/0.87 undef294}> 0.79/0.87 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + k^0), sum^0 -> undef327}> 0.79/0.87 0}> 0.79/0.87 undef349}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 (1 + i^0)}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 (1 + j^0)}> 0.79/0.87 0.79/0.87 0.79/0.87 (0 + temp^0)}> 0.79/0.87 0.79/0.87 (0 + undef494), tmp^0 -> undef494}> 0.79/0.87 0.79/0.87 0}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 Fresh variables: 0.79/0.87 undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, 0.79/0.87 0.79/0.87 Undef variables: 0.79/0.87 undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, 0.79/0.87 0.79/0.87 Abstraction variables: 0.79/0.87 0.79/0.87 Exit nodes: 0.79/0.87 0.79/0.87 Accepting locations: 0.79/0.87 0.79/0.87 Asserts: 0.79/0.87 0.79/0.87 Preprocessed LLVMGraph 0.79/0.87 Init Location: 0 0.79/0.87 Transitions: 0.79/0.87 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 0}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 0, i^0 -> (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 0, i^0 -> (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 0, i^0 -> (1 + i^0)}> 0.79/0.87 (1 + j^0)}> 0.79/0.87 (0 + (0 + undef494)), j^0 -> (1 + j^0)}> 0.79/0.87 (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + (1 + j^0))}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + (1 + j^0))}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 0, j^0 -> (1 + j^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + j^0)}> 0.79/0.87 0.79/0.87 0.79/0.87 (1 + j^0)}> 0.79/0.87 0.79/0.87 0.79/0.87 (1 + k^0)}> 0.79/0.87 (1 + i^0), j^0 -> (1 + j^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0), j^0 -> (1 + j^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (1 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0), j^0 -> (1 + j^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0), j^0 -> (1 + j^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (0 + undef255), i^0 -> (1 + i^0), imax^0 -> (0 + i^0)}> 0.79/0.87 (1 + k^0)}> 0.79/0.87 0.79/0.87 Fresh variables: 0.79/0.87 undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, 0.79/0.87 0.79/0.87 Undef variables: 0.79/0.87 undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, 0.79/0.87 0.79/0.87 Abstraction variables: 0.79/0.87 0.79/0.87 Exit nodes: 0.79/0.87 0.79/0.87 Accepting locations: 0.79/0.87 0.79/0.87 Asserts: 0.79/0.87 0.79/0.87 ************************************************************* 0.79/0.87 ******************************************************************************************* 0.79/0.87 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.79/0.87 ******************************************************************************************* 0.79/0.87 0.79/0.87 Init Location: 0 0.79/0.87 Graph 0: 0.79/0.87 Transitions: 0.79/0.87 Variables: 0.79/0.87 0.79/0.87 Graph 1: 0.79/0.87 Transitions: 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 undef494, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 Variables: 0.79/0.87 big^0, i^0, j^0, n^0 0.79/0.87 0.79/0.87 Graph 2: 0.79/0.87 Transitions: 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 Variables: 0.79/0.87 i^0, imax^0, j^0, n^0, k^0, big^0 0.79/0.87 0.79/0.87 Graph 3: 0.79/0.87 Transitions: 0.79/0.87 Variables: 0.79/0.87 0.79/0.87 Precedence: 0.79/0.87 Graph 0 0.79/0.87 0.79/0.87 Graph 1 0.79/0.87 0, rest remain the same}> 0.79/0.87 0.79/0.87 Graph 2 0.79/0.87 0, rest remain the same}> 0.79/0.87 0, rest remain the same}> 0.79/0.87 0, rest remain the same}> 0.79/0.87 0, rest remain the same}> 0.79/0.87 0.79/0.87 Graph 3 0.79/0.87 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 2 + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> 2 + j^0, rest remain the same}> 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 Map Locations to Subgraph: 0.79/0.87 ( 0 , 0 ) 0.79/0.87 ( 1 , 1 ) 0.79/0.87 ( 7 , 2 ) 0.79/0.87 ( 17 , 2 ) 0.79/0.87 ( 24 , 2 ) 0.79/0.87 ( 25 , 3 ) 0.79/0.87 0.79/0.87 ******************************************************************************************* 0.79/0.87 ******************************** CHECKING ASSERTIONS ******************************** 0.79/0.87 ******************************************************************************************* 0.79/0.87 0.79/0.87 Proving termination of subgraph 0 0.79/0.87 Proving termination of subgraph 1 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.020202 0.79/0.87 Some transition disabled by a set of invariant(s): 0.79/0.87 Invariant at l1: 0 <= big^0 0.79/0.87 0.79/0.87 Strengthening and disabling transitions... 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, i^0 -> 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef494, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.011496 0.79/0.87 0.79/0.87 Checking conditional termination of SCC {l1}... 0.79/0.87 0.79/0.87 LOG: CALL solveLinear 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear - Elapsed time: 0.003361s 0.79/0.87 Ranking function: -2 - 2*i^0 + 2*n^0 0.79/0.87 New Graphs: 0.79/0.87 Transitions: 0.79/0.87 1 + j^0, rest remain the same}> 0.79/0.87 undef494, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 Variables: 0.79/0.87 big^0, j^0, n^0 0.79/0.87 Checking conditional termination of SCC {l1}... 0.79/0.87 0.79/0.87 LOG: CALL solveLinear 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear - Elapsed time: 0.001639s 0.79/0.87 Ranking function: -j^0 + n^0 0.79/0.87 New Graphs: 0.79/0.87 Proving termination of subgraph 2 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.128358 0.79/0.87 Some transition disabled by a set of invariant(s): 0.79/0.87 Invariant at l24: j^0 <= k^0 0.79/0.87 0.79/0.87 Strengthening and disabling transitions... 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.272338 0.79/0.87 Some transition disabled by a set of invariant(s): 0.79/0.87 Invariant at l24: 1 <= 0 0.79/0.87 0.79/0.87 Strengthening and disabling transitions... 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, rest remain the same}> 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.063033 0.79/0.87 Some transition disabled by a set of invariant(s): 0.79/0.87 Invariant at l7: 1 + n^0 <= i^0 0.79/0.87 Invariant at l17: 1 + n^0 <= i^0 0.79/0.87 0.79/0.87 Strengthening and disabling transitions... 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.06217 0.79/0.87 Some transition disabled by a set of invariant(s): 0.79/0.87 Invariant at l7: j^0 <= n^0 0.79/0.87 Invariant at l17: j^0 <= n^0 0.79/0.87 0.79/0.87 Strengthening and disabling transitions... 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 It's unfeasible. Removing transition: 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 0.79/0.87 0.79/0.87 LOG: CALL solverLinear in Graph for feasibility 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear in Graph for feasibility 0.79/0.87 Strengthening transition (result): 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 Checking unfeasibility... 0.79/0.87 Time used: 0.045164 0.79/0.87 0.79/0.87 Location 24 unreachable! 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 undef255, i^0 -> 1 + i^0, imax^0 -> i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 > It's unfeasible. Removing transition: 0.79/0.87 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 Checking conditional termination of SCC {l7, l17}... 0.79/0.87 0.79/0.87 LOG: CALL solveLinear 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear - Elapsed time: 0.009316s 0.79/0.87 Ranking function: -2 - 2*imax^0 - j^0 + 3*n^0 0.79/0.87 New Graphs: 0.79/0.87 Transitions: 0.79/0.87 0, j^0 -> 1 + j^0, rest remain the same}> 0.79/0.87 0.79/0.87 0.79/0.87 1 + k^0, rest remain the same}> 0.79/0.87 Variables: 0.79/0.87 big^0, i^0, imax^0, j^0, k^0, n^0 0.79/0.87 Checking conditional termination of SCC {l7, l17}... 0.79/0.87 0.79/0.87 LOG: CALL solveLinear 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear - Elapsed time: 0.002366s 0.79/0.87 Ranking function: -2 + 2*i^0 - k^0 - n^0 0.79/0.87 New Graphs: 0.79/0.87 Transitions: 0.79/0.87 0, j^0 -> ((0 + 1) + 0) + j^0, rest remain the same}> 0.79/0.87 0, j^0 -> ((0 + 1) + 0) + j^0, rest remain the same}> 0.79/0.87 Variables: 0.79/0.87 big^0, i^0, imax^0, j^0, k^0, n^0 0.79/0.87 Checking conditional termination of SCC {l7}... 0.79/0.87 0.79/0.87 LOG: CALL solveLinear 0.79/0.87 0.79/0.87 LOG: RETURN solveLinear - Elapsed time: 0.002672s 0.79/0.87 Ranking function: -2 + 2*i^0 + imax^0 - j^0 - 2*n^0 0.79/0.87 New Graphs: 0.79/0.87 Proving termination of subgraph 3 0.79/0.87 Analyzing SCC {l25}... 0.79/0.87 No cycles found. 0.79/0.87 0.79/0.87 Program Terminates 0.79/0.87 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.79/0.87 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.79/0.87 EOF