/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0, y_6^0 -> (1 + y_6^0)}> undef17}> 0}> 1, x_5^0 -> (1 + x_5^0)}> undef29}> Fresh variables: undef17, undef29, Undef variables: undef17, undef29, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0, x_5^0 -> (1 + x_5^0), y_6^0 -> (1 + y_6^0)}> 1, x_5^0 -> (1 + x_5^0)}> Fresh variables: undef17, undef29, Undef variables: undef17, undef29, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 1, x_5^0 -> 1 + x_5^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002234 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000595s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001945s [47044 : 47045] [47044 : 47046] Successful child: 47045 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> New Graphs: LOG: CALL check - Post:y_6^0 <= 1 + b_7^0 + x_5^0 - Process 1 * Exit transition: * Postcondition : y_6^0 <= 1 + b_7^0 + x_5^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000411s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000499s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: y_6^0 <= 1 + b_7^0 + x_5^0 , Narrowing transition: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000675s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002449s [47044 : 47050] [47044 : 47051] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009878s Time used: 0.009411 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021550s Time used: 0.021546 LOG: SAT solveNonLinear - Elapsed time: 0.031428s Cost: 1; Total time: 0.030957 Termination implied by a set of invariant(s): Invariant at l4: 1 + x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - 2*x_5^0 + y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000756s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002828s [47044 : 47055] [47044 : 47056] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010205s Time used: 0.009694 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017240s Time used: 0.017237 LOG: SAT solveNonLinear - Elapsed time: 0.027445s Cost: 1; Total time: 0.026931 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + b_7^0 - 3*x_5^0 + 2*y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000848s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003486s [47044 : 47064] [47044 : 47065] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011296s Time used: 0.010754 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017008s Time used: 0.017003 LOG: SAT solveNonLinear - Elapsed time: 0.028304s Cost: 1; Total time: 0.027757 Termination implied by a set of invariant(s): Invariant at l4: 1 + x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - b_7^0 - 3*x_5^0 + 2*y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000941s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003887s [47044 : 47077] [47044 : 47078] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011514s Time used: 0.010961 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015481s Time used: 0.015477 LOG: SAT solveNonLinear - Elapsed time: 0.026995s Cost: 1; Total time: 0.026438 Termination implied by a set of invariant(s): Invariant at l4: 1 + x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + b_7^0 - x_5^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001042s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005045s [47044 : 47229] [47044 : 47230] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010417s Time used: 0.009831 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015534s Time used: 0.01553 LOG: SAT solveNonLinear - Elapsed time: 0.025951s Cost: 1; Total time: 0.025361 Termination implied by a set of invariant(s): Invariant at l4: b_7^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + b_7^0 - x_5^0 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001147s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004972s [47044 : 47234] [47044 : 47235] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011618s Time used: 0.010998 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018616s Time used: 0.018612 LOG: SAT solveNonLinear - Elapsed time: 0.030235s Cost: 1; Total time: 0.02961 Termination implied by a set of invariant(s): Invariant at l4: 1 + x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - b_7^0 - x_5^0 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001249s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006280s [47044 : 47241] [47044 : 47242] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011279s Time used: 0.010622 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019908s Time used: 0.019896 LOG: SAT solveNonLinear - Elapsed time: 0.031187s Cost: 1; Total time: 0.030518 Termination implied by a set of invariant(s): Invariant at l4: x_5^0 <= 1 + y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + b_7^0 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001333s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006614s [47044 : 47252] [47044 : 47253] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011856s Time used: 0.011168 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019662s Time used: 0.019658 LOG: SAT solveNonLinear - Elapsed time: 0.031518s Cost: 1; Total time: 0.030826 Termination implied by a set of invariant(s): Invariant at l4: b_7^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + b_7^0 + x_5^0 - 2*y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001453s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008001s [47044 : 47263] [47044 : 47264] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013012s Time used: 0.012275 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017346s Time used: 0.017336 LOG: SAT solveNonLinear - Elapsed time: 0.030358s Cost: 1; Total time: 0.029611 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - b_7^0 + x_5^0 - 2*y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001574s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007537s [47044 : 47270] [47044 : 47271] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013153s Time used: 0.012421 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016103s Time used: 0.016099 LOG: SAT solveNonLinear - Elapsed time: 0.029256s Cost: 1; Total time: 0.02852 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001640s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008807s [47044 : 47275] [47044 : 47276] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013554s Time used: 0.012791 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020655s Time used: 0.020651 LOG: SAT solveNonLinear - Elapsed time: 0.034209s Cost: 1; Total time: 0.033442 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 + x_5^0 - 2*y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001723s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009308s [47044 : 47282] [47044 : 47283] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013960s Time used: 0.013162 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019811s Time used: 0.019807 LOG: SAT solveNonLinear - Elapsed time: 0.033772s Cost: 1; Total time: 0.032969 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001824s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008815s [47044 : 47291] [47044 : 47292] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013402s Time used: 0.012579 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021446s Time used: 0.021442 LOG: SAT solveNonLinear - Elapsed time: 0.034849s Cost: 1; Total time: 0.034021 Termination implied by a set of invariant(s): Invariant at l4: 0 <= b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - b_7^0 - x_5^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001880s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010409s [47044 : 47298] [47044 : 47299] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015375s Time used: 0.014023 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017900s Time used: 0.017896 LOG: SAT solveNonLinear - Elapsed time: 0.033275s Cost: 1; Total time: 0.031919 Termination implied by a set of invariant(s): Invariant at l4: 1 + x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - b_7^0 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001975s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012473s [47044 : 47303] [47044 : 47304] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014435s Time used: 0.01301 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020353s Time used: 0.020349 LOG: SAT solveNonLinear - Elapsed time: 0.034788s Cost: 1; Total time: 0.033359 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + b_7^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Quasi-ranking function: 50000 - y_6^0 New Graphs: Transitions: 0, x_5^0 -> 1 + x_5^0, y_6^0 -> 1 + y_6^0, rest remain the same}> Variables: b_7^0, x_5^0, y_6^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002038s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011701s [47044 : 47308] [47044 : 47309] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015861s Time used: 0.014546 [47044 : 47313] [47044 : 47324] Successful child: 47313 Program does NOT terminate