0.95/0.99 YES 0.95/0.99 0.95/0.99 Solver Timeout: 4 0.95/0.99 Global Timeout: 300 0.95/0.99 No parsing errors! 0.95/0.99 Init Location: 0 0.95/0.99 Transitions: 0.95/0.99 0.95/0.99 0.95/0.99 (0 + scale^0), maxarg2^0 -> (0 + undef30), tmp^0 -> undef30}> 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 (1 + j^0)}> 0.95/0.99 (1 + i^0)}> 0.95/0.99 0.95/0.99 undef191}> 0.95/0.99 (1 + i^0), sum^0 -> undef208}> 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0}> 0.95/0.99 0.95/0.99 (0 + (~(1) * undef360)), tmp___4^0 -> undef359, tmp___5^0 -> undef360}> 0.95/0.99 (0 + undef376), tmp___2^0 -> undef375, tmp___3^0 -> undef376}> 0.95/0.99 0.95/0.99 undef410}> 0.95/0.99 (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> 0.95/0.99 0.95/0.99 0.95/0.99 0}> 0.95/0.99 0.95/0.99 undef513}> 0.95/0.99 0.95/0.99 0.95/0.99 (1 + i^0)}> 0.95/0.99 0.95/0.99 (1 + k^0)}> 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0}> 0.95/0.99 (1 + i^0)}> 0.95/0.99 (0 + maxarg2^0)}> 0.95/0.99 (0 + maxarg1^0)}> 0.95/0.99 0.95/0.99 0.95/0.99 Fresh variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Undef variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Abstraction variables: 0.95/0.99 0.95/0.99 Exit nodes: 0.95/0.99 0.95/0.99 Accepting locations: 0.95/0.99 0.95/0.99 Asserts: 0.95/0.99 0.95/0.99 Preprocessed LLVMGraph 0.95/0.99 Init Location: 0 0.95/0.99 Transitions: 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 0}> 0.95/0.99 0.95/0.99 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0), scale^0 -> 0}> 0.95/0.99 (1 + i^0), scale^0 -> (0 + (0 + undef30))}> 0.95/0.99 (1 + i^0), scale^0 -> (0 + (0 + scale^0))}> 0.95/0.99 (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}> 0.95/0.99 (1 + j^0)}> 0.95/0.99 (1 + i^0)}> 0.95/0.99 0.95/0.99 (1 + i^0), sum^0 -> undef208}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0), scale^0 -> 0}> 0.95/0.99 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0)}> 0.95/0.99 (1 + k^0), scale^0 -> 0}> 0.95/0.99 0.95/0.99 (1 + i^0), sum^0 -> ((0 + sum^0) + undef410)}> 0.95/0.99 (1 + i^0), sum^0 -> ((0 + sum^0) + undef410)}> 0.95/0.99 (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}> 0.95/0.99 0.95/0.99 (1 + i^0)}> 0.95/0.99 0.95/0.99 Fresh variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Undef variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Abstraction variables: 0.95/0.99 0.95/0.99 Exit nodes: 0.95/0.99 0.95/0.99 Accepting locations: 0.95/0.99 0.95/0.99 Asserts: 0.95/0.99 0.95/0.99 ************************************************************* 0.95/0.99 ******************************************************************************************* 0.95/0.99 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.95/0.99 ******************************************************************************************* 0.95/0.99 0.95/0.99 Init Location: 0 0.95/0.99 Graph 0: 0.95/0.99 Transitions: 0.95/0.99 Variables: 0.95/0.99 0.95/0.99 Graph 1: 0.95/0.99 Transitions: 0.95/0.99 0.95/0.99 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 1 + i^0, scale^0 -> undef30, rest remain the same}> 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 1 + j^0, rest remain the same}> 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 0.95/0.99 1 + i^0, sum^0 -> undef208, rest remain the same}> 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 0.95/0.99 1 + i^0, sum^0 -> sum^0 + undef410, rest remain the same}> 0.95/0.99 1 + i^0, sum^0 -> sum^0 + undef410, rest remain the same}> 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 Variables: 0.95/0.99 i^0, n^0, scale^0, k^0, j^0, sum^0 0.95/0.99 0.95/0.99 Graph 2: 0.95/0.99 Transitions: 0.95/0.99 Variables: 0.95/0.99 0.95/0.99 Precedence: 0.95/0.99 Graph 0 0.95/0.99 0.95/0.99 Graph 1 0.95/0.99 0, rest remain the same}> 0.95/0.99 0.95/0.99 Graph 2 0.95/0.99 0.95/0.99 0.95/0.99 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 0.95/0.99 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 0.95/0.99 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 1 + k^0, rest remain the same}> 0.95/0.99 0.95/0.99 Map Locations to Subgraph: 0.95/0.99 ( 0 , 0 ) 0.95/0.99 ( 4 , 1 ) 0.95/0.99 ( 6 , 2 ) 0.95/0.99 ( 10 , 1 ) 0.95/0.99 ( 12 , 1 ) 0.95/0.99 ( 21 , 1 ) 0.95/0.99 ( 25 , 1 ) 0.95/0.99 0.95/0.99 ******************************************************************************************* 0.95/0.99 ******************************** CHECKING ASSERTIONS ******************************** 0.95/0.99 ******************************************************************************************* 0.95/0.99 0.95/0.99 Proving termination of subgraph 0 0.95/0.99 Proving termination of subgraph 1 0.95/0.99 Checking unfeasibility... 0.95/0.99 Time used: 0.287666 0.95/0.99 Some transition disabled by a set of invariant(s): 0.95/0.99 Invariant at l4: 1 + k^0 <= n^0 0.95/0.99 Invariant at l12: n^0 <= 1 + i^0 0.95/0.99 Invariant at l21: 1 + n^0 <= i^0 0.95/0.99 Invariant at l25: 1 + k^0 <= n^0 0.95/0.99 0.95/0.99 Strengthening and disabling transitions... 0.95/0.99 > It's unfeasible. Removing transition: 0.95/0.99 1 + i^0, sum^0 -> sum^0 + undef410, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + i^0, scale^0 -> undef30, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + i^0, sum^0 -> undef208, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 It's unfeasible. Removing transition: 0.95/0.99 1 + i^0, sum^0 -> sum^0 + undef410, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 It's unfeasible. Removing transition: 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 0.95/0.99 0.95/0.99 LOG: CALL solverLinear in Graph for feasibility 0.95/0.99 0.95/0.99 LOG: RETURN solveLinear in Graph for feasibility 0.95/0.99 Strengthening transition (result): 0.95/0.99 1 + i^0, rest remain the same}> 0.95/0.99 Checking unfeasibility... 0.95/0.99 Time used: 0.083934 0.95/1.00 Some transition disabled by a set of invariant(s): 0.95/1.00 Invariant at l4: 0 <= scale^0 0.95/1.00 Invariant at l25: 1 + n^0 <= i^0 0.95/1.00 0.95/1.00 Strengthening and disabling transitions... 0.95/1.00 > It's unfeasible. Removing transition: 0.95/1.00 1 + i^0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 It's unfeasible. Removing transition: 0.95/1.00 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + i^0, scale^0 -> undef30, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + i^0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 Checking unfeasibility... 0.95/1.00 Time used: 0.146458 0.95/1.00 Some transition disabled by a set of invariant(s): 0.95/1.00 Invariant at l10: 1 + n^0 <= i^0 0.95/1.00 Invariant at l12: 1 + n^0 <= i^0 0.95/1.00 Invariant at l21: n^0 <= i^0 0.95/1.00 Invariant at l25: 1 <= scale^0 0.95/1.00 0.95/1.00 Strengthening and disabling transitions... 0.95/1.00 > It's unfeasible. Removing transition: 0.95/1.00 1 + i^0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + j^0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 It's unfeasible. Removing transition: 0.95/1.00 1 + i^0, sum^0 -> undef208, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 1 + k^0, scale^0 -> 0, rest remain the same}> 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 0.95/1.00 LOG: CALL solverLinear in Graph for feasibility 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear in Graph for feasibility 0.95/1.00 Strengthening transition (result): 0.95/1.00 0.95/1.00 Checking unfeasibility... 0.95/1.00 Time used: 0.261975 0.95/1.00 0.95/1.00 Checking conditional termination of SCC {l4, l10, l12, l21, l25}... 0.95/1.00 0.95/1.00 LOG: CALL solveLinear 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear - Elapsed time: 0.013824s 0.95/1.00 Ranking function: -2 - k^0 + n^0 0.95/1.00 New Graphs: 0.95/1.00 Transitions: 0.95/1.00 1 + i^0, scale^0 -> undef30, rest remain the same}> 0.95/1.00 1 + i^0, rest remain the same}> 0.95/1.00 Variables: 0.95/1.00 i^0, k^0, n^0, scale^0 0.95/1.00 Transitions: 0.95/1.00 ((0 + 1) + 0) + j^0, rest remain the same}> 0.95/1.00 Variables: 0.95/1.00 i^0, j^0, n^0 0.95/1.00 Checking conditional termination of SCC {l4}... 0.95/1.00 0.95/1.00 LOG: CALL solveLinear 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear - Elapsed time: 0.002477s 0.95/1.00 Ranking function: -i^0 + n^0 0.95/1.00 New Graphs: 0.95/1.00 Transitions: 0.95/1.00 ((0 + 1) + 0) + j^0, rest remain the same}> 0.95/1.00 Variables: 0.95/1.00 i^0, j^0, n^0 0.95/1.00 Checking conditional termination of SCC {l10}... 0.95/1.00 0.95/1.00 LOG: CALL solveLinear 0.95/1.00 0.95/1.00 LOG: RETURN solveLinear - Elapsed time: 0.001297s 0.95/1.00 Ranking function: -1 - j^0 + n^0 0.95/1.00 New Graphs: 0.95/1.00 Proving termination of subgraph 2 0.95/1.00 Analyzing SCC {l6}... 0.95/1.00 No cycles found. 0.95/1.00 0.95/1.00 Program Terminates 0.95/1.00 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.95/1.00 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.95/1.00 EOF