/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (~(1) + x^0), y^0 -> (~(1) + y^0), z^0 -> (1 + z^0)}> (0 + y^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + x^0), y^0 -> (~(1) + y^0), z^0 -> (1 + z^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002038 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000432s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001215s [16879 : 16880] [16879 : 16881] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008469s Time used: 0.008198 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015603s Time used: 0.0156 LOG: SAT solveNonLinear - Elapsed time: 0.024072s Cost: 1; Total time: 0.023798 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= 1 + x^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - x^0 + 2*y^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002947s [16879 : 16885] [16879 : 16886] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009071s Time used: 0.00869 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015770s Time used: 0.015766 LOG: SAT solveNonLinear - Elapsed time: 0.024841s Cost: 1; Total time: 0.024456 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= x^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + y^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000671s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002565s [16879 : 16890] [16879 : 16891] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009195s Time used: 0.008757 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020351s Time used: 0.020348 LOG: SAT solveNonLinear - Elapsed time: 0.029547s Cost: 1; Total time: 0.029105 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + 2*x^0 - y^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000841s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003304s [16879 : 16895] [16879 : 16896] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009178s Time used: 0.008689 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016536s Time used: 0.016533 LOG: SAT solveNonLinear - Elapsed time: 0.025714s Cost: 1; Total time: 0.025222 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + x^0 + y^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000925s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003854s [16879 : 17039] [16879 : 17040] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010361s Time used: 0.009834 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019298s Time used: 0.019294 LOG: SAT solveNonLinear - Elapsed time: 0.029659s Cost: 1; Total time: 0.029128 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + x^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000874s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003670s [16879 : 17044] [16879 : 17045] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009986s Time used: 0.009455 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017163s Time used: 0.017159 LOG: SAT solveNonLinear - Elapsed time: 0.027149s Cost: 1; Total time: 0.026614 Quasi-ranking function: 50000 + x^0 + y^0 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000988s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003992s [16879 : 17049] [16879 : 17050] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010308s Time used: 0.009706 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014359s Time used: 0.014354 LOG: SAT solveNonLinear - Elapsed time: 0.024666s Cost: 1; Total time: 0.02406 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + x^0 + y^0 + z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001096s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004644s [16879 : 17054] [16879 : 17055] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065818s Time used: 0.065199 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017073s Time used: 0.01707 LOG: SAT solveNonLinear - Elapsed time: 0.082891s Cost: 1; Total time: 0.082269 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= x^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - x^0 + 3*y^0 + z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001189s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006430s [16879 : 17059] [16879 : 17060] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.404701s Time used: 3.4037 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019684s Time used: 0.019678 LOG: SAT solveNonLinear - Elapsed time: 3.424385s Cost: 1; Total time: 3.42338 Quasi-ranking function: 50000 + 4*x^0 - 2*y^0 + z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001328s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006863s [16879 : 17065] [16879 : 17066] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013132s Time used: 0.012139 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017000s Time used: 0.016996 LOG: SAT solveNonLinear - Elapsed time: 0.030131s Cost: 1; Total time: 0.029135 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - 2*x^0 + 2*y^0 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007037s [16879 : 17070] [16879 : 17071] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013165s Time used: 0.012212 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021246s Time used: 0.021243 LOG: SAT solveNonLinear - Elapsed time: 0.034411s Cost: 1; Total time: 0.033455 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - 2*x^0 - 2*y^0 - 5*z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001518s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006973s [16879 : 17075] [16879 : 17076] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013075s Time used: 0.012085 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018781s Time used: 0.018773 LOG: SAT solveNonLinear - Elapsed time: 0.031856s Cost: 1; Total time: 0.030858 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + x^0 - y^0 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007399s [16879 : 17080] [16879 : 17081] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012799s Time used: 0.011802 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020120s Time used: 0.020115 LOG: SAT solveNonLinear - Elapsed time: 0.032919s Cost: 1; Total time: 0.031917 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - 2*y^0 - 3*z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001717s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007835s [16879 : 17085] [16879 : 17086] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013712s Time used: 0.012755 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016800s Time used: 0.016796 LOG: SAT solveNonLinear - Elapsed time: 0.030512s Cost: 1; Total time: 0.029551 Quasi-ranking function: 50000 + 3*y^0 + 2*z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001798s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011751s [16879 : 17090] [16879 : 17091] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014152s Time used: 0.013153 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019319s Time used: 0.019315 LOG: SAT solveNonLinear - Elapsed time: 0.033471s Cost: 1; Total time: 0.032468 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= 1 + y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 + y^0 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001885s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008721s [16879 : 17095] [16879 : 17096] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013708s Time used: 0.01219 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017365s Time used: 0.017361 LOG: SAT solveNonLinear - Elapsed time: 0.031073s Cost: 1; Total time: 0.029551 Quasi-ranking function: 50000 + 3*x^0 + 2*z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001977s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012887s [16879 : 17100] [16879 : 17101] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015034s Time used: 0.013291 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019957s Time used: 0.019953 LOG: SAT solveNonLinear - Elapsed time: 0.034991s Cost: 1; Total time: 0.033244 Termination implied by a set of invariant(s): Invariant at l1: x^0 <= y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^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): -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Quasi-ranking function: 50000 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002079s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012427s [16879 : 17246] [16879 : 17247] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015016s Time used: 0.013261 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018011s Time used: 0.018006 LOG: SAT solveNonLinear - Elapsed time: 0.033027s Cost: 1; Total time: 0.031267 Quasi-ranking function: 50000 - 2*x^0 - 3*z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002154s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012112s [16879 : 17251] [16879 : 17252] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014573s Time used: 0.012822 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019587s Time used: 0.019583 LOG: SAT solveNonLinear - Elapsed time: 0.034160s Cost: 1; Total time: 0.032405 Quasi-ranking function: 50000 + x^0 - z^0 New Graphs: Transitions: -1 + x^0, y^0 -> -1 + y^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002247s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012671s [16879 : 17256] [16879 : 17257] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014992s Time used: 0.013494 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001550s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001626s Cannot prove unreachability [16879 : 17261] [16879 : 17483] Successful child: 17261 Program does NOT terminate