/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: (1 + x_5^0), y_6^0 -> (1 + y_6^0), z_7^0 -> (~(1) + z_7^0)}> undef9}> undef13}> undef17}> Fresh variables: undef9, undef13, undef17, Undef variables: undef9, undef13, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + x_5^0), y_6^0 -> (1 + y_6^0), z_7^0 -> (~(1) + z_7^0)}> Fresh variables: undef9, undef13, undef17, Undef variables: undef9, undef13, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002107 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000450s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001216s [63885 : 63886] [63885 : 63887] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009226s Time used: 0.008937 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000573s Time used: 1.00029 LOG: SAT solveNonLinear - Elapsed time: 1.009798s Cost: 1; Total time: 1.00923 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - 2*x_5^0 - z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000604s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002638s [63885 : 63891] [63885 : 63892] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011079s Time used: 0.010577 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002630s Time used: 1.0025 LOG: SAT solveNonLinear - Elapsed time: 1.013709s Cost: 1; Total time: 1.01308 Termination implied by a set of invariant(s): Invariant at l1: z_7^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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + x_5^0 + 2*z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000790s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004336s [63885 : 63896] [63885 : 63897] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015803s Time used: 0.015039 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000887s Time used: 1.00075 LOG: SAT solveNonLinear - Elapsed time: 1.016690s Cost: 1; Total time: 1.01579 Termination implied by a set of invariant(s): Invariant at l1: 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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + 2*x_5^0 - y_6^0 + 2*z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000995s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004119s [63885 : 63901] [63885 : 63902] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015641s Time used: 0.014745 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000698s Time used: 1.00058 LOG: SAT solveNonLinear - Elapsed time: 1.016340s Cost: 1; Total time: 1.01533 Termination implied by a set of invariant(s): Invariant at l1: 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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + x_5^0 + y_6^0 + 3*z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001055s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004436s [63885 : 63906] [63885 : 63907] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016608s Time used: 0.015703 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000869s Time used: 1.00059 LOG: SAT solveNonLinear - Elapsed time: 1.017476s Cost: 1; Total time: 1.01629 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= 1 + x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + y_6^0 + 2*z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001167s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006101s [63885 : 63911] [63885 : 63912] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015735s Time used: 0.014669 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000534s Time used: 1.00042 LOG: SAT solveNonLinear - Elapsed time: 1.016269s Cost: 1; Total time: 1.01509 Termination implied by a set of invariant(s): Invariant at l1: z_7^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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 + y_6^0 + z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001270s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010499s [63885 : 63916] [63885 : 63917] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017256s Time used: 0.016142 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000569s Time used: 1.00046 LOG: SAT solveNonLinear - Elapsed time: 1.017824s Cost: 1; Total time: 1.0166 Termination implied by a set of invariant(s): Invariant at l1: y_6^0 <= 1 + x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 - y_6^0 + z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001502s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011900s [63885 : 63921] [63885 : 63922] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018581s Time used: 0.017378 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000723s Time used: 1.00061 LOG: SAT solveNonLinear - Elapsed time: 1.019305s Cost: 1; Total time: 1.01799 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= 1 + x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - 2*x_5^0 + y_6^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001601s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015056s [63885 : 64034] [63885 : 64035] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018248s Time used: 0.016944 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000715s Time used: 1.0006 LOG: SAT solveNonLinear - Elapsed time: 1.018963s Cost: 1; Total time: 1.01755 Termination implied by a set of invariant(s): Invariant at l1: 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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - 3*x_5^0 + y_6^0 - z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001775s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012232s [63885 : 64039] [63885 : 64040] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017761s Time used: 0.016362 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000783s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.018544s Cost: 1; Total time: 1.01702 Termination implied by a set of invariant(s): Invariant at l1: y_6^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 - y_6^0 - z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001670s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008816s [63885 : 64044] [63885 : 64045] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019399s Time used: 0.01742 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000744s Time used: 1.00062 LOG: SAT solveNonLinear - Elapsed time: 1.020143s Cost: 1; Total time: 1.01804 Termination implied by a set of invariant(s): Invariant at l1: y_6^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + 2*x_5^0 - 5*y_6^0 - 2*z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001778s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014517s [63885 : 64049] [63885 : 64050] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016813s Time used: 0.015364 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000661s Time used: 1.00053 LOG: SAT solveNonLinear - Elapsed time: 1.017474s Cost: 1; Total time: 1.0159 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 + z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001799s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011139s [63885 : 64054] [63885 : 64055] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017337s Time used: 0.015828 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000985s Time used: 1.00087 LOG: SAT solveNonLinear - Elapsed time: 1.018321s Cost: 1; Total time: 1.0167 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001876s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011568s [63885 : 64059] [63885 : 64060] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017225s Time used: 0.015729 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000893s Time used: 1.00078 LOG: SAT solveNonLinear - Elapsed time: 1.018118s Cost: 1; Total time: 1.01651 Termination implied by a set of invariant(s): Invariant at l1: z_7^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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - 2*y_6^0 - z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001978s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010857s [63885 : 64064] [63885 : 64065] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019423s Time used: 0.016902 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000915s Time used: 1.0008 LOG: SAT solveNonLinear - Elapsed time: 1.020337s Cost: 1; Total time: 1.0177 Termination implied by a set of invariant(s): Invariant at l1: z_7^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): 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - y_6^0 + z_7^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001996s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009448s [63885 : 64069] [63885 : 64070] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020847s Time used: 0.018369 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001437s Time used: 1.00133 LOG: SAT solveNonLinear - Elapsed time: 1.022283s Cost: 1; Total time: 1.0197 Termination implied by a set of invariant(s): Invariant at l1: y_6^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 + 2*x_5^0 - 3*y_6^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002095s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012082s [63885 : 64074] [63885 : 64075] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019021s Time used: 0.016398 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000775s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.019796s Cost: 1; Total time: 1.01706 Termination implied by a set of invariant(s): Invariant at l1: z_7^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - y_6^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002248s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013444s [63885 : 64079] [63885 : 64080] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018881s Time used: 0.016143 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002796s Time used: 1.00253 LOG: SAT solveNonLinear - Elapsed time: 1.021676s Cost: 1; Total time: 1.01868 Quasi-ranking function: 50000 - x_5^0 - y_6^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002262s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011115s [63885 : 64118] [63885 : 64119] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020999s Time used: 0.018167 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000972s Time used: 1.00083 LOG: SAT solveNonLinear - Elapsed time: 1.021970s Cost: 1; Total time: 1.019 Termination implied by a set of invariant(s): Invariant at l1: y_6^0 <= x_5^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^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_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 New Graphs: Transitions: 1 + x_5^0, y_6^0 -> 1 + y_6^0, z_7^0 -> -1 + z_7^0, rest remain the same}> Variables: x_5^0, y_6^0, z_7^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002350s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012919s [63885 : 64231] [63885 : 64232] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104683s Time used: 4.10137 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.005759s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005868s Cannot prove unreachability [63885 : 64470] [63885 : 64503] Successful child: 64470 Program does NOT terminate