/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^0), y^0 -> (1 + y^0)}> 0, y^0 -> 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)}> 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, rest remain the same}> Variables: x^0, y^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.001799 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000382s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000963s [16581 : 16582] [16581 : 16583] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006956s Time used: 0.00668 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000574s Time used: 1.00057 LOG: SAT solveNonLinear - Elapsed time: 1.007530s Cost: 1; Total time: 1.00726 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: 1 + x^0, y^0 -> 1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000460s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001480s [16581 : 16702] [16581 : 16703] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012296s Time used: 0.011879 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000618s Time used: 1.00061 LOG: SAT solveNonLinear - Elapsed time: 1.012914s Cost: 1; Total time: 1.01249 Termination implied by a set of invariant(s): Invariant at l1: 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, 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, rest remain the same}> Quasi-ranking function: 50000 - y^0 New Graphs: Transitions: 1 + x^0, y^0 -> 1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000542s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002319s [16581 : 16708] [16581 : 16709] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012824s Time used: 0.012301 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000358s Time used: 1.00034 LOG: SAT solveNonLinear - Elapsed time: 1.013182s Cost: 1; Total time: 1.01264 Termination implied by a set of invariant(s): Invariant at l1: 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, 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, rest remain the same}> Quasi-ranking function: 50000 - 2*x^0 + y^0 New Graphs: Transitions: 1 + x^0, y^0 -> 1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000646s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002866s [16581 : 16713] [16581 : 16714] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011464s Time used: 0.010769 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000425s Time used: 1.00041 LOG: SAT solveNonLinear - Elapsed time: 1.011888s Cost: 1; Total time: 1.01118 Termination implied by a set of invariant(s): Invariant at l1: 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, 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, rest remain the same}> Quasi-ranking function: 50000 + x^0 - 2*y^0 New Graphs: Transitions: 1 + x^0, y^0 -> 1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000730s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002864s [16581 : 16718] [16581 : 16719] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011128s Time used: 0.010344 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000440s Time used: 1.00044 LOG: SAT solveNonLinear - Elapsed time: 1.011568s Cost: 1; Total time: 1.01078 Termination implied by a set of invariant(s): Invariant at l1: 0 <= 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, 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, rest remain the same}> Quasi-ranking function: 50000 - x^0 - y^0 New Graphs: Transitions: 1 + x^0, y^0 -> 1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000826s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003819s [16581 : 16723] [16581 : 16724] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101585s Time used: 4.1008 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.032558s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.032667s Cannot prove unreachability [16581 : 16763] [16581 : 16764] Successful child: 16763 Program does NOT terminate