/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 + x^0) + y^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + y^0)}> ((0 + x^0) + 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: x^0 + y^0, rest remain the same}> x^0 + y^0, rest remain the same}> Variables: x^0, y^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003095 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000880s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005630s [36391 : 36392] [36391 : 36393] Successful child: 36393 Ranking function: x^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: x^0 + 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.000537s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001905s [36391 : 36397] [36391 : 36398] Successful child: 36397 [ 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: x^0 + 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: x^0 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^0 + y^0, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000373s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000434s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 <= 0 , Narrowing transition: x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, rest remain the same}> x^0 + 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.000873s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005785s [36391 : 36402] [36391 : 36403] Successful child: 36403 Ranking function: x^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: x^0 + 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.000530s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001886s [36391 : 36407] [36391 : 36408] Successful child: 36407 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + 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: x^0 + 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 It's unfeasible. Removing transition: x^0 + y^0, rest remain the same}> New Graphs: LOG: CALL check - Post:y^0 <= 0 - Process 2 * Exit transition: * Postcondition : y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000296s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000361s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: y^0 <= 0 , It's unfeasible. Removing transition: x^0 + y^0, rest remain the same}> Narrowing transition: x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + 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.000534s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001895s [36391 : 36412] [36391 : 36413] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007126s Time used: 0.006715 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016711s Time used: 0.016705 LOG: SAT solveNonLinear - Elapsed time: 0.023837s Cost: 1; Total time: 0.02342 Termination implied by a set of invariant(s): Invariant at l2: 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): x^0 + 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): x^0 + y^0, rest remain the same}> Quasi-ranking function: 50000 - x^0 + y^0 New Graphs: Transitions: x^0 + 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.000630s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002401s [36391 : 36417] [36391 : 36418] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007344s Time used: 0.006934 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015690s Time used: 0.015685 LOG: SAT solveNonLinear - Elapsed time: 0.023034s Cost: 1; Total time: 0.022619 Termination implied by a set of invariant(s): Invariant at l2: 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): x^0 + 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): x^0 + y^0, rest remain the same}> Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: x^0 + 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.000607s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002288s [36391 : 36422] [36391 : 36423] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007539s Time used: 0.007072 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015577s Time used: 0.015564 LOG: SAT solveNonLinear - Elapsed time: 0.023116s Cost: 1; Total time: 0.022636 Termination implied by a set of invariant(s): Invariant at l2: 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): x^0 + 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): x^0 + y^0, rest remain the same}> Quasi-ranking function: 50000 - x^0 - y^0 New Graphs: Transitions: x^0 + 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.000710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002860s [36391 : 36433] [36391 : 36434] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008819s Time used: 0.00844 [36391 : 36785] [36391 : 36789] Successful child: 36785 Program does NOT terminate