/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) /\ (arg2 > ~(1)), par{arg1 -> arg2}> 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}> 1) /\ ((arg2 + 1) >= (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}> 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> undef13, arg2 -> undef14}> Fresh variables: undef13, undef14, Undef variables: undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1))> 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}> 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef13, undef14, Undef variables: undef13, undef14, 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}> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> 1 + arg1, 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.011886 Some transition disabled by a set of invariant(s): Invariant at l2: arg2 <= 1 + arg1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, 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): 2 + 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}> Checking unfeasibility... Time used: 0.043438 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002088s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.307093s [28972 : 28973] [28972 : 28974] Successful child: 28973 [ 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: 2 + 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 2 + 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}> 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.000680s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000792s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 2 + 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.001989s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.291057s [28972 : 28980] [28972 : 28981] Successful child: 28980 [ 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): 2 + 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... > 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> New Graphs: Transitions: 2 + 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.001512s Ranking function: (~(1) / 3)*arg1 + (1 / 3)*arg2 New Graphs: LOG: CALL check - Post:arg1 + 2*arg2 <= 3 - Process 2 * Exit transition: * Postcondition : arg1 + 2*arg2 <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000623s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000736s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + 2*arg2 <= 3 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 2 + 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.002357s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.417757s [28972 : 28985] [28972 : 28986] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.906941s Time used: 0.905577 [28972 : 29158] [28972 : 29162] Successful child: 29158 Program does NOT terminate