/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0) /\ (undef5 > ~(1)) /\ (1 = arg2), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> ~(1)) /\ (arg2 > 1) /\ (undef9 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> arg2, arg4 -> 2}> ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> Fresh variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Undef variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (0 = undef23), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0) /\ (undef5 > ~(1)) /\ (1 = undef23), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> ~(1)) /\ (undef23 > 1) /\ (undef9 > ~(1)) /\ (undef22 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2}> ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> Fresh variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Undef variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, 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 + arg1, rest remain the same}> -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1, rest remain the same}> undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 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.006637 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001805s Ranking function: -2 + 2*arg3 - 2*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002511s [3913 : 3914] [3913 : 3915] Successful child: 3914 [ 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 + 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 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, 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 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000659s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001743s Ranking function: -2 + 2*arg3 - 2*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000660s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002648s [3913 : 3919] [3913 : 3920] Successful child: 3919 [ 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 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, 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 + arg1, rest remain the same}> Ranking function: arg2 New Graphs: LOG: CALL check - Post:arg1 + arg4 <= 1 + arg3 - Process 2 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> * Postcondition : arg1 + arg4 <= 1 + arg3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000496s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000617s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg4 <= 1 + arg3 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002252s Ranking function: -2 + arg1 - arg3 + arg4 New Graphs: Transitions: -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001291s Ranking function: -1 + arg3 - arg4 New Graphs: Program Terminates