/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)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> (arg1 - 1), arg2 -> (arg2 + 1)}> undef7, arg2 -> undef8}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)> arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 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.00348 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000961s Ranking function: 1 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000448s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001534s [27757 : 27758] [27757 : 27759] Successful child: 27758 [ 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 + arg2 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 + arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000643s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000777s INVARIANTS: 2: 0 <= arg1 + arg2 , Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 0 , 0 <= arg1 , Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001695s Ranking function: 2 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000941s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004695s [27757 : 27763] [27757 : 27764] Successful child: 27763 [ 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000669s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002478s [27757 : 27768] [27757 : 27769] Successful child: 27768 [ 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: INVARIANTS: 2: 1 <= arg1 + arg2 , 0 <= 1 + arg2 , Quasi-INVARIANTS to narrow Graph: 2: [27757 : 27773] [27757 : 27774] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= arg1 + arg2 , arg1 <= arg2 , arg2 <= arg1 , It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001493s Ranking function: -2 + 2*arg1 - 2*arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000631s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002491s [27757 : 27775] [27757 : 27776] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011396s Time used: 0.01093 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000459s Time used: 1.00036 LOG: SAT solveNonLinear - Elapsed time: 1.011856s Cost: 1; Total time: 1.01129 Quasi-ranking function: 50000 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000665s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002595s [27757 : 27876] [27757 : 27877] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014284s Time used: 0.013624 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000645s Time used: 1.00056 LOG: SAT solveNonLinear - Elapsed time: 1.014928s Cost: 1; Total time: 1.01419 Quasi-ranking function: 50000 + 2*arg1 + arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000766s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004380s [27757 : 27881] [27757 : 27882] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013297s Time used: 0.012529 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000607s Time used: 1.00053 LOG: SAT solveNonLinear - Elapsed time: 1.013904s Cost: 1; Total time: 1.01306 Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000770s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003296s [27757 : 27886] [27757 : 27887] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014885s Time used: 0.014053 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005980s Time used: 1.00588 LOG: SAT solveNonLinear - Elapsed time: 1.020865s Cost: 1; Total time: 1.01993 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, 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 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000838s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003434s [27757 : 27892] [27757 : 27893] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014457s Time used: 0.013606 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000732s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.015189s Cost: 1; Total time: 1.01426 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 1 + arg2, 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 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 - 2*arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000932s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003700s [27757 : 27897] [27757 : 27898] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103805s Time used: 4.10275 [27757 : 27902] [27757 : 27906] Successful child: 27902 Program does NOT terminate