4.13/4.17 YES 4.13/4.17 4.13/4.17 Solver Timeout: 4 4.13/4.17 Global Timeout: 300 4.13/4.17 No parsing errors! 4.13/4.17 Init Location: 0 4.13/4.17 Transitions: 4.13/4.17 4.13/4.17 4.13/4.17 0}> 4.13/4.17 1}> 4.13/4.17 4.13/4.17 4.13/4.17 1}> 4.13/4.17 4.13/4.17 4.13/4.17 (1 + nj^0)}> 4.13/4.17 (0 + tmp___2^0)}> 4.13/4.17 4.13/4.17 1}> 4.13/4.17 0}> 4.13/4.17 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 4.13/4.17 (0 + tmp___1^0)}> 4.13/4.17 1}> 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 (1 + ni^0)}> 4.13/4.17 4.13/4.17 (0 + tmp___0^0), nj^0 -> 0}> 4.13/4.17 1}> 4.13/4.17 0}> 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 0}> 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 4.13/4.17 0}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 1, bNoCapture^0 -> 1, nDim^0 -> 9, ni^0 -> 0, tmp^0 -> undef486}> 4.13/4.17 4.13/4.17 4.13/4.17 Fresh variables: 4.13/4.17 undef486, 4.13/4.17 4.13/4.17 Undef variables: 4.13/4.17 undef486, 4.13/4.17 4.13/4.17 Abstraction variables: 4.13/4.17 4.13/4.17 Exit nodes: 4.13/4.17 4.13/4.17 Accepting locations: 4.13/4.17 4.13/4.17 Asserts: 4.13/4.17 4.13/4.17 Preprocessed LLVMGraph 4.13/4.17 Init Location: 0 4.13/4.17 Transitions: 4.13/4.17 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 4.13/4.17 (1 + nj^0)}> 4.13/4.17 (0 + 0)}> 4.13/4.17 4.13/4.17 4.13/4.17 (0 + 0)}> 4.13/4.17 4.13/4.17 4.13/4.17 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 1), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 1), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 4.13/4.17 (1 + ni^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 0), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1), nj^0 -> (1 + nj^0)}> 4.13/4.17 (0 + 1)}> 4.13/4.17 (0 + 0)}> 4.13/4.17 (0 + 1)}> 4.13/4.17 4.13/4.17 Fresh variables: 4.13/4.17 undef486, 4.13/4.17 4.13/4.17 Undef variables: 4.13/4.17 undef486, 4.13/4.17 4.13/4.17 Abstraction variables: 4.13/4.17 4.13/4.17 Exit nodes: 4.13/4.17 4.13/4.17 Accepting locations: 4.13/4.17 4.13/4.17 Asserts: 4.13/4.17 4.13/4.17 ************************************************************* 4.13/4.17 ******************************************************************************************* 4.13/4.17 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 4.13/4.17 ******************************************************************************************* 4.13/4.17 4.13/4.17 Init Location: 0 4.13/4.17 Graph 0: 4.13/4.17 Transitions: 4.13/4.17 Variables: 4.13/4.17 4.13/4.17 Graph 1: 4.13/4.17 Transitions: 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 ni^0 4.13/4.17 4.13/4.17 Graph 2: 4.13/4.17 Transitions: 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1 + nj^0, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 4.13/4.17 4.13/4.17 0, rest remain the same}> 4.13/4.17 4.13/4.17 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, ni^0, nj^0, bNoCapture^0 4.13/4.17 4.13/4.17 Graph 3: 4.13/4.17 Transitions: 4.13/4.17 Variables: 4.13/4.17 4.13/4.17 Precedence: 4.13/4.17 Graph 0 4.13/4.17 4.13/4.17 Graph 1 4.13/4.17 4.13/4.17 4.13/4.17 Graph 2 4.13/4.17 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 Graph 3 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 1 + ni^0, rest remain the same}> 4.13/4.17 4.13/4.17 Map Locations to Subgraph: 4.13/4.17 ( 0 , 0 ) 4.13/4.17 ( 2 , 3 ) 4.13/4.17 ( 7 , 2 ) 4.13/4.17 ( 9 , 1 ) 4.13/4.17 ( 14 , 2 ) 4.13/4.17 ( 17 , 2 ) 4.13/4.17 4.13/4.17 ******************************************************************************************* 4.13/4.17 ******************************** CHECKING ASSERTIONS ******************************** 4.13/4.17 ******************************************************************************************* 4.13/4.17 4.13/4.17 Proving termination of subgraph 0 4.13/4.17 Proving termination of subgraph 1 4.13/4.17 Checking unfeasibility... 4.13/4.17 Time used: 0.001438 4.13/4.17 4.13/4.17 Checking conditional termination of SCC {l9}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.000804s 4.13/4.17 Ranking function: 8 - ni^0 4.13/4.17 New Graphs: 4.13/4.17 Proving termination of subgraph 2 4.13/4.17 Checking unfeasibility... 4.13/4.17 Time used: 0.478833 4.13/4.17 Some transition disabled by a set of invariant(s): 4.13/4.17 Invariant at l14: 0 <= bNoCapture^0 4.13/4.17 4.13/4.17 Strengthening and disabling transitions... 4.13/4.17 > It's unfeasible. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Checking unfeasibility... 4.13/4.17 Time used: 0.214884 4.13/4.17 Some transition disabled by a set of invariant(s): 4.13/4.17 Invariant at l7: 0 <= bDomain^0 4.13/4.17 Invariant at l14: 0 <= bDomain^0 4.13/4.17 Invariant at l17: 0 <= bDomain^0 4.13/4.17 4.13/4.17 Strengthening and disabling transitions... 4.13/4.17 > It's unfeasible. Removing transition: 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 It's unfeasible. Removing transition: 4.13/4.17 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 0, rest remain the same}> 4.13/4.17 4.13/4.17 LOG: CALL solverLinear in Graph for feasibility 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear in Graph for feasibility 4.13/4.17 Strengthening transition (result): 4.13/4.17 1, rest remain the same}> 4.13/4.17 Checking unfeasibility... 4.13/4.17 Time used: 0.966884 4.13/4.17 4.13/4.17 Checking conditional termination of SCC {l7, l14, l17}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.031762s 4.13/4.17 Ranking function: -16 + 30*bDomain^0 - 2*ni^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 4.13/4.17 1 + nj^0, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7, l14}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.020772s 4.13/4.17 Ranking function: 119 - 2*bDomain^0 - 17*ni^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 1 + nj^0, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7, l14}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.014818s 4.13/4.17 Ranking function: 168 - 19*ni^0 - 2*nj^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7, l14}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.015242s 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.418504s 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101868s 4.13/4.17 Time used: 0.089824 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105782s 4.13/4.17 Time used: 0.086709 4.13/4.17 Trying to remove transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189722s 4.13/4.17 Time used: 0.170577 4.13/4.17 4.13/4.17 LOG: SAT solveNonLinear - Elapsed time: 0.189722s 4.13/4.17 Cost: 0; Total time: 0.170577 4.13/4.17 Termination implied by a set of quasi-invariant(s): 4.13/4.17 Quasi-invariant at l7: 0 <= bNoCapture^0 4.13/4.17 Quasi-invariant at l14: 0 <= bDomain^0 + bNoCapture^0 4.13/4.17 Ranking function: bNoCapture^0 4.13/4.17 Ranking function and negation of Quasi-Invariant applied 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, rest remain the same}> 4.13/4.17 1, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7, l14}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.010680s 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.214496s 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064873s 4.13/4.17 Time used: 0.056289 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069652s 4.13/4.17 Time used: 0.057254 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068486s 4.13/4.17 Time used: 0.056111 4.13/4.17 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069363s 4.13/4.17 Time used: 0.057004 4.13/4.17 Trying to remove transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067210s 4.13/4.17 Time used: 0.054772 4.13/4.17 Trying to remove transition: 1, rest remain the same}> 4.13/4.17 Solving with 1 template(s). 4.13/4.17 4.13/4.17 LOG: CALL solveNonLinearGetFirstSolution 4.13/4.17 4.13/4.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.226132s 4.13/4.17 Time used: 0.213771 4.13/4.17 4.13/4.17 LOG: SAT solveNonLinear - Elapsed time: 0.226132s 4.13/4.17 Cost: 0; Total time: 0.213771 4.13/4.17 Termination implied by a set of quasi-invariant(s): 4.13/4.17 Quasi-invariant at l7: bNoCapture^0 <= 1 4.13/4.17 Quasi-invariant at l14: bNoCapture^0 <= 1 4.13/4.17 Ranking function: -bNoCapture^0 4.13/4.17 Ranking function and negation of Quasi-Invariant applied 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 It's unfeasible after collapsing. Removing transition: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.016517s 4.13/4.17 Ranking function: (~(53) / 2) + 18*bNoCapture^0 + (17 / 2)*ni^0 + (~(17) / 2)*nj^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.009674s 4.13/4.17 Ranking function: (~(17) / 2) + (17 / 2)*ni^0 + (~(17) / 2)*nj^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 1, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.009138s 4.13/4.17 Ranking function: -7 + 30*bNoCapture^0 - ni^0 - 2*nj^0 4.13/4.17 New Graphs: 4.13/4.17 Transitions: 4.13/4.17 0, nj^0 -> 1 + nj^0, rest remain the same}> 4.13/4.17 Variables: 4.13/4.17 bDomain^0, bNoCapture^0, ni^0, nj^0 4.13/4.17 Checking conditional termination of SCC {l7}... 4.13/4.17 4.13/4.17 LOG: CALL solveLinear 4.13/4.17 4.13/4.17 LOG: RETURN solveLinear - Elapsed time: 0.002612s 4.13/4.17 Ranking function: 8 - nj^0 4.13/4.17 New Graphs: 4.13/4.17 Proving termination of subgraph 3 4.13/4.17 Analyzing SCC {l2}... 4.13/4.17 No cycles found. 4.13/4.17 4.13/4.17 Program Terminates 4.13/4.17 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 4.13/4.17 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 4.13/4.17 EOF