/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)}> 1, 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.001808 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000629s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001130s [23909 : 23910] [23909 : 23911] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006505s Time used: 0.006242 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001329s Time used: 1.00128 LOG: SAT solveNonLinear - Elapsed time: 1.007834s Cost: 1; Total time: 1.00753 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.000455s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001485s [23909 : 24201] [23909 : 24202] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008079s Time used: 0.007622 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000333s Time used: 1.0003 LOG: SAT solveNonLinear - Elapsed time: 1.008412s Cost: 1; Total time: 1.00792 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= 1 [ 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.000538s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002335s [23909 : 24206] [23909 : 24207] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009715s Time used: 0.009185 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000942s Time used: 1.00054 LOG: SAT solveNonLinear - Elapsed time: 1.010658s Cost: 1; Total time: 1.00973 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= 1 [ 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.000653s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002866s [23909 : 24406] [23909 : 24407] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010143s Time used: 0.00946 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000936s Time used: 1.00089 LOG: SAT solveNonLinear - Elapsed time: 1.011079s Cost: 1; Total time: 1.01035 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= 1 [ 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.000742s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003189s [23909 : 24546] [23909 : 24547] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011005s Time used: 0.01023 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.009059s Time used: 1.00901 LOG: SAT solveNonLinear - Elapsed time: 1.020064s Cost: 1; Total time: 1.01924 Quasi-ranking function: 50000 - 3*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.000841s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003787s [23909 : 24572] [23909 : 24573] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101547s Time used: 4.1007 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.006650s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.006753s Cannot prove unreachability [23909 : 24635] [23909 : 24637] Successful child: 24635 Program does NOT terminate