0.00/0.38 YES 0.00/0.38 0.00/0.38 Solver Timeout: 4 0.00/0.38 Global Timeout: 300 0.00/0.38 No parsing errors! 0.00/0.38 Init Location: 0 0.00/0.38 Transitions: 0.00/0.38 0.00/0.38 0.00/0.38 0.00/0.38 0.00/0.38 (1 + Inner14^0)}> 0.00/0.38 (1 + Index15^0)}> 0.00/0.38 (1 + Outer13^0)}> 0.00/0.38 0}> 0.00/0.38 0.00/0.38 0}> 0.00/0.38 0.00/0.38 0.00/0.38 (1 + OuterIndex8^0)}> 0.00/0.38 (1 + InnerIndex9^0), Seed^0 -> undef140, ret_RandomInteger17^0 -> (0 + undef140)}> 0.00/0.38 0}> 0.00/0.38 0}> 0.00/0.38 0.00/0.38 0.00/0.38 (1 + OuterIndex5^0)}> 0.00/0.38 (1 + InnerIndex6^0), Seed^0 -> undef206, ret_RandomInteger16^0 -> (0 + undef206)}> 0.00/0.38 0}> 0.00/0.38 0}> 0.00/0.38 0, Seed^0 -> 0}> 0.00/0.38 0.00/0.38 0.00/0.38 Fresh variables: 0.00/0.38 undef140, undef206, 0.00/0.38 0.00/0.38 Undef variables: 0.00/0.38 undef140, undef206, 0.00/0.38 0.00/0.38 Abstraction variables: 0.00/0.38 0.00/0.38 Exit nodes: 0.00/0.38 0.00/0.38 Accepting locations: 0.00/0.38 0.00/0.38 Asserts: 0.00/0.38 0.00/0.38 Preprocessed LLVMGraph 0.00/0.38 Init Location: 0 0.00/0.38 Transitions: 0.00/0.38 0, OuterIndex8^0 -> 0}> 0.00/0.38 0}> 0.00/0.38 0, OuterIndex5^0 -> (1 + OuterIndex5^0), OuterIndex8^0 -> 0}> 0.00/0.38 0, OuterIndex5^0 -> (1 + OuterIndex5^0), OuterIndex8^0 -> 0}> 0.00/0.38 0, OuterIndex5^0 -> (1 + OuterIndex5^0)}> 0.00/0.38 (1 + InnerIndex6^0)}> 0.00/0.38 (1 + Inner14^0), Outer13^0 -> (1 + Outer13^0)}> 0.00/0.38 0, Inner14^0 -> (1 + Inner14^0)}> 0.00/0.38 (1 + Index15^0)}> 0.00/0.38 0.00/0.38 0, Outer13^0 -> (1 + Outer13^0)}> 0.00/0.38 0, Inner14^0 -> 0}> 0.00/0.38 0, OuterIndex8^0 -> (1 + OuterIndex8^0)}> 0.00/0.38 0, OuterIndex8^0 -> (1 + OuterIndex8^0)}> 0.00/0.38 (1 + InnerIndex9^0)}> 0.00/0.38 0.00/0.38 Fresh variables: 0.00/0.38 undef140, undef206, 0.00/0.38 0.00/0.38 Undef variables: 0.00/0.38 undef140, undef206, 0.00/0.38 0.00/0.38 Abstraction variables: 0.00/0.38 0.00/0.38 Exit nodes: 0.00/0.38 0.00/0.38 Accepting locations: 0.00/0.38 0.00/0.38 Asserts: 0.00/0.38 0.00/0.38 ************************************************************* 0.00/0.38 ******************************************************************************************* 0.00/0.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.38 ******************************************************************************************* 0.00/0.38 0.00/0.38 Init Location: 0 0.00/0.38 Graph 0: 0.00/0.38 Transitions: 0.00/0.38 Variables: 0.00/0.38 0.00/0.38 Graph 1: 0.00/0.38 Transitions: 0.00/0.38 0, OuterIndex5^0 -> 1 + OuterIndex5^0, rest remain the same}> 0.00/0.38 1 + InnerIndex6^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 InnerIndex6^0, OuterIndex5^0, __const_20^0 0.00/0.38 0.00/0.38 Graph 2: 0.00/0.38 Transitions: 0.00/0.38 0, OuterIndex8^0 -> 1 + OuterIndex8^0, rest remain the same}> 0.00/0.38 1 + InnerIndex9^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 InnerIndex9^0, OuterIndex8^0, __const_20^0 0.00/0.38 0.00/0.38 Graph 3: 0.00/0.38 Transitions: 0.00/0.38 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0, Inner14^0 -> 0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 Index15^0, Inner14^0, Outer13^0, __const_20^0 0.00/0.38 0.00/0.38 Graph 4: 0.00/0.38 Transitions: 0.00/0.38 Variables: 0.00/0.38 0.00/0.38 Precedence: 0.00/0.38 Graph 0 0.00/0.38 0.00/0.38 Graph 1 0.00/0.38 0, rest remain the same}> 0.00/0.38 0.00/0.38 Graph 2 0.00/0.38 0, OuterIndex5^0 -> 1 + OuterIndex5^0, OuterIndex8^0 -> 0, rest remain the same}> 0.00/0.38 0.00/0.38 Graph 3 0.00/0.38 0, OuterIndex8^0 -> 0, rest remain the same}> 0.00/0.38 0, OuterIndex5^0 -> 1 + OuterIndex5^0, OuterIndex8^0 -> 0, rest remain the same}> 0.00/0.38 0, OuterIndex8^0 -> 1 + OuterIndex8^0, rest remain the same}> 0.00/0.38 0.00/0.38 Graph 4 0.00/0.38 0.00/0.38 0.00/0.38 Map Locations to Subgraph: 0.00/0.38 ( 0 , 0 ) 0.00/0.38 ( 3 , 1 ) 0.00/0.38 ( 9 , 3 ) 0.00/0.38 ( 11 , 3 ) 0.00/0.38 ( 13 , 4 ) 0.00/0.38 ( 14 , 2 ) 0.00/0.38 0.00/0.38 ******************************************************************************************* 0.00/0.38 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.38 ******************************************************************************************* 0.00/0.38 0.00/0.38 Proving termination of subgraph 0 0.00/0.38 Proving termination of subgraph 1 0.00/0.38 Checking unfeasibility... 0.00/0.38 Time used: 0.005562 0.00/0.38 0.00/0.38 Checking conditional termination of SCC {l3}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.001340s 0.00/0.38 Ranking function: -OuterIndex5^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Transitions: 0.00/0.38 1 + InnerIndex6^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 InnerIndex6^0, __const_20^0 0.00/0.38 Checking conditional termination of SCC {l3}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.000810s 0.00/0.38 Ranking function: -1 - InnerIndex6^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Proving termination of subgraph 2 0.00/0.38 Checking unfeasibility... 0.00/0.38 Time used: 0.004883 0.00/0.38 0.00/0.38 Checking conditional termination of SCC {l14}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.001383s 0.00/0.38 Ranking function: -OuterIndex8^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Transitions: 0.00/0.38 1 + InnerIndex9^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 InnerIndex9^0, __const_20^0 0.00/0.38 Checking conditional termination of SCC {l14}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.000848s 0.00/0.38 Ranking function: -1 - InnerIndex9^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Proving termination of subgraph 3 0.00/0.38 Checking unfeasibility... 0.00/0.38 Time used: 0.020773 0.00/0.38 Some transition disabled by a set of invariant(s): 0.00/0.38 Invariant at l9: 0 <= 1 + Outer13^0 0.00/0.38 Invariant at l11: 0 <= Outer13^0 0.00/0.38 0.00/0.38 Strengthening and disabling transitions... 0.00/0.38 > It's unfeasible. Removing transition: 0.00/0.38 0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 0, Inner14^0 -> 0, rest remain the same}> 0.00/0.38 Checking unfeasibility... 0.00/0.38 Time used: 0.013977 0.00/0.38 0.00/0.38 Checking conditional termination of SCC {l9, l11}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.002557s 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.014741s 0.00/0.38 Trying to remove transition: 0, Inner14^0 -> 0, rest remain the same}> 0.00/0.38 Solving with 1 template(s). 0.00/0.38 0.00/0.38 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.38 0.00/0.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021489s 0.00/0.38 Time used: 0.020687 0.00/0.38 Trying to remove transition: 1 + Index15^0, rest remain the same}> 0.00/0.38 Solving with 1 template(s). 0.00/0.38 0.00/0.38 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.38 0.00/0.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024523s 0.00/0.38 Time used: 0.022246 0.00/0.38 Trying to remove transition: 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 Solving with 1 template(s). 0.00/0.38 0.00/0.38 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.38 0.00/0.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.073517s 0.00/0.38 Time used: 0.071997 0.00/0.38 Trying to remove transition: 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 Solving with 1 template(s). 0.00/0.38 0.00/0.38 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.38 0.00/0.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021804s 0.00/0.38 Time used: 0.018999 0.00/0.38 Solving with 1 template(s). 0.00/0.38 0.00/0.38 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.38 0.00/0.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079899s 0.00/0.38 Time used: 0.07751 0.00/0.38 0.00/0.38 LOG: SAT solveNonLinear - Elapsed time: 0.079899s 0.00/0.38 Cost: 0; Total time: 0.07751 0.00/0.38 Termination implied by a set of invariant(s): 0.00/0.38 Invariant at l9: 1 + Outer13^0 <= __const_20^0 0.00/0.38 [ Invariant Graph ] 0.00/0.38 Strengthening and disabling transitions... 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 [ Termination Graph ] 0.00/0.38 Strengthening and disabling transitions... 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Strengthening transition (result): 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 0.00/0.38 LOG: CALL solverLinear in Graph for feasibility 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.38 Ranking function: -Outer13^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Transitions: 0.00/0.38 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}> 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 Index15^0, Inner14^0, Outer13^0, __const_20^0 0.00/0.38 Checking conditional termination of SCC {l9}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.002101s 0.00/0.38 Ranking function: -Inner14^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 Transitions: 0.00/0.38 1 + Index15^0, rest remain the same}> 0.00/0.38 Variables: 0.00/0.38 Index15^0, Outer13^0, __const_20^0 0.00/0.38 Checking conditional termination of SCC {l9}... 0.00/0.38 0.00/0.38 LOG: CALL solveLinear 0.00/0.38 0.00/0.38 LOG: RETURN solveLinear - Elapsed time: 0.001217s 0.00/0.38 Ranking function: -1 - Index15^0 + __const_20^0 0.00/0.38 New Graphs: 0.00/0.38 INVARIANTS: 0.00/0.38 9: 1 + Outer13^0 <= __const_20^0 , 0.00/0.38 Quasi-INVARIANTS to narrow Graph: 0.00/0.38 9: 0.00/0.38 Proving termination of subgraph 4 0.00/0.38 Analyzing SCC {l13}... 0.00/0.38 No cycles found. 0.00/0.38 0.00/0.38 Program Terminates 0.00/0.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.38 EOF