/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: ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}> 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> undef9, arg2 -> undef10}> Fresh variables: undef1, undef2, undef9, undef10, Undef variables: undef1, undef2, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef10 > 1) /\ (undef2 > ~(1)) /\ (undef9 > 0)> 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}> 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> Fresh variables: undef1, undef2, undef9, undef10, Undef variables: undef1, undef2, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, 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.006583 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001434s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035092s [35406 : 35414] [35406 : 35415] Successful child: 35414 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, rest remain the same}> > It's unfeasible. Removing transition: arg2, arg2 -> 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, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000691s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000815s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001461s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039141s [35406 : 35424] [35406 : 35425] Successful child: 35424 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] 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 It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 0 - Process 2 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000905s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001055s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001525s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040937s [35406 : 35498] [35406 : 35499] Successful child: 35498 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -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: arg2, arg2 -> arg1, rest remain the same}> Ranking function: arg1 + arg2 New Graphs: LOG: CALL check - Post:arg1 + arg2 <= 2 - Process 3 * Exit transition: * Postcondition : arg1 + arg2 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000853s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001007s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 2 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053239s [35406 : 35581] [35406 : 35582] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040730s Time used: 0.039715 [35406 : 35586] [35406 : 35590] Successful child: 35586 Program does NOT terminate