/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 + i^0), y^0 -> (0 + j^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)}> (~(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}> -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 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003274 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000880s Ranking function: 1 + 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 {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000415s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001375s [4857 : 4858] [4857 : 4859] Successful child: 4858 [ 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= x^0 - Process 1 * Exit transition: * Postcondition : 0 <= x^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000521s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000624s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= x^0 , It's unfeasible. Removing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Narrowing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000466s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001459s [4857 : 4863] [4857 : 4864] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006258s Time used: 0.005929 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014043s Time used: 0.01404 LOG: SAT solveNonLinear - Elapsed time: 0.020301s Cost: 1; Total time: 0.019969 Termination implied by a set of invariant(s): Invariant at l2: x^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): -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 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 {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000447s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001459s [4857 : 4868] [4857 : 4869] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006755s Time used: 0.006386 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012297s Time used: 0.012294 LOG: SAT solveNonLinear - Elapsed time: 0.019052s Cost: 1; Total time: 0.01868 Termination implied by a set of invariant(s): Invariant at l2: 1 + x^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): -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 {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000562s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002175s [4857 : 4879] [4857 : 4880] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006850s Time used: 0.006444 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016530s Time used: 0.016525 LOG: SAT solveNonLinear - Elapsed time: 0.023381s Cost: 1; Total time: 0.022969 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 {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003542s [4857 : 4909] [4857 : 4910] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.100435s Time used: 4.10007 [4857 : 4946] [4857 : 4950] Successful child: 4946 Program does NOT terminate