/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, arg2 -> 20}> 0, arg2 -> 0}> arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> (arg1 + 1)}> 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 0) /\ (0 = arg1), par{arg1 -> 1}> undef11, arg2 -> undef12}> Fresh variables: undef11, undef12, Undef variables: undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef12 > ~(1))> 0, arg2 -> 0}> arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> (arg1 + 1)}> 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 0) /\ (0 = arg1), par{arg1 -> 1}> Fresh variables: undef11, undef12, Undef variables: undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, arg2 -> 0, rest remain the same}> 1 + arg1, rest remain the same}> 0, arg2 -> -1 + arg1, rest remain the same}> 1, 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.371996 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003044s Ranking function: -1 + arg2 New Graphs: Transitions: 0, arg2 -> 0, rest remain the same}> 1 + arg1, rest remain the same}> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001312s Ranking function: -5 - arg1 + 3*arg2 New Graphs: Transitions: 0, arg2 -> 0, rest remain the same}> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000905s Ranking function: -1 - arg1 + arg2 New Graphs: Transitions: 0, arg2 -> 0, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000422s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001236s [26866 : 26910] [26866 : 26911] Successful child: 26910 [ 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: 0, arg2 -> 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 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg2 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 0, arg2 -> 0, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg2 <= arg1 - Process 1 * Exit transition: * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000651s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000762s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 <= arg1 , Narrowing transition: 0, arg2 -> 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg2 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 0, arg2 -> 0, rest remain the same}> 1 + arg1, rest remain the same}> 0, arg2 -> -1 + arg1, rest remain the same}> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002209s Ranking function: -1 + arg2 New Graphs: Transitions: 0, arg2 -> 0, rest remain the same}> 1 + arg1, rest remain the same}> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001557s Ranking function: -1 - arg1 + arg2 New Graphs: Transitions: 0, arg2 -> 0, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000515s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001530s [26866 : 26933] [26866 : 26934] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.446530s Time used: 0.446211 [26866 : 27204] [26866 : 27208] Successful child: 27204 Program does NOT terminate