/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 -> 0}> 1, arg2 -> 2}> 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 0, arg2 -> 9}> undef15, arg2 -> undef16}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef16 > ~(1))> 1, arg2 -> 2}> 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 0, arg2 -> 9}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1, arg2 -> 2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> -1 + arg2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> -1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> Variables: arg2, arg1 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.391442 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004800s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.070025s [11615 : 11616] [11615 : 11617] Successful child: 11616 [ 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, arg2 -> 2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, 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: 0, 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, 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: 0, 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: 0, arg2 -> 9, 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, arg2 -> 2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, 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: 0, 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, 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: 0, 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: 0, arg2 -> 9, 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.000647s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000747s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: 1, arg2 -> 2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg2 -> 9, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1, arg2 -> 2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> -1 + arg2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> -1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> Variables: arg2, arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002108s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.070126s [11615 : 11621] [11615 : 11622] Successful child: 11621 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, 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: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, 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, arg2 -> 2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> New Graphs: Transitions: 1, arg2 -> 2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> -1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001869s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.065782s [11615 : 11626] [11615 : 11627] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102254s Time used: 4.10091 [11615 : 11631] [11615 : 11635] Successful child: 11631 Program does NOT terminate