/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> main_i}> 0))> 0)> = main_j)> = main_j))> (main_i + 1)}> (main_j + 1)}> 2)> 2))> (main_i + 1)}> (main_j + 1)}> (main_j - 1)}> 0))> 0)> (main_i - 1)}> (main_j + 1)}> (main_i + 1)}> (main_i + 1)}> main_i)> main_i))> (main_j - 1)}> (main_j + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1, main_j -> main_i}> 0)> 0))> = main_j)> = main_j))> (main_i + 1)}> (main_j + 1)}> 2)> 2))> (main_i + 1)}> (main_j + 1)}> (main_j - 1)}> 0)> 0))> (main_i - 1)}> (main_j + 1)}> (main_i + 1)}> (main_i + 1)}> main_i)> main_i))> (main_j - 1)}> (main_j + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 35, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | j | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_i >= main_j) /\ (main_j < 5) /\ (((main_i + 1) - (main_j + 1)) > 2), par{main_i -> ((main_i + 1) + 1), main_j -> (main_j + 1)}> 0) /\ (main_i >= main_j) /\ (main_j < 5) /\ not((((main_i + 1) - (main_j + 1)) > 2)), par{main_i -> (main_i + 1), main_j -> ((main_j + 1) + 1)}> 0) /\ (main_i >= main_j) /\ not((main_j < 5)), par{main_i -> (main_i + 1), main_j -> (main_j - 1)}> 0) /\ not((main_i >= main_j)) /\ (main_i > 0) /\ not((main_j < 0)) /\ ((main_j * 2) > (main_i + 1)), par{main_i -> (main_i + 1), main_j -> (main_j - 1)}> 0))> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 35, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> 2 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 35 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.097988 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004056s Ranking function: 5 + (~(1) / 2)*main_i + (~(1) / 2)*main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001956s Ranking function: -main_i + main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001079s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029746s [34252 : 34269] [34252 : 34270] Successful child: 34269 [ 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: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_i <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_i <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000733s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i <= 0 , Narrowing transition: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> 2 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002809s Ranking function: 5 + (~(1) / 2)*main_i + (~(1) / 2)*main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001992s Ranking function: -main_i + main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001069s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029260s [34252 : 34492] [34252 : 34493] Successful child: 34492 [ 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: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, 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: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> New Graphs: LOG: CALL check - Post:main_j <= 0 - Process 2 * Exit transition: * Postcondition : main_j <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000611s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000707s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= main_j , main_j <= main_i , main_j <= 0 , Narrowing transition: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> 2 + main_j, rest remain the same}> 1 + main_i, main_j -> 2 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003928s Ranking function: 60 - 15*main_i New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> 2 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003058s Ranking function: 176 - 18*main_i - 17*main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002283s Ranking function: -6*main_i + 6*main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001097s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046116s [34252 : 34497] [34252 : 34498] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047555s Time used: 0.046713 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000516s Time used: 1.0005 LOG: SAT solveNonLinear - Elapsed time: 1.048071s Cost: 1; Total time: 1.04722 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_j [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, 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): 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - 2*main_i + 3*main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j 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.072873s [34252 : 34502] [34252 : 34503] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.057479s Time used: 0.056486 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000634s Time used: 1.00062 LOG: SAT solveNonLinear - Elapsed time: 1.058112s Cost: 1; Total time: 1.0571 Quasi-ranking function: 50000 - main_i New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001500s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.066153s [34252 : 34507] [34252 : 34508] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.063933s Time used: 0.062859 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000875s Time used: 1.00086 LOG: SAT solveNonLinear - Elapsed time: 1.064808s Cost: 1; Total time: 1.06372 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i + main_j [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 2 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, 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): 2 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - 2*main_i - main_j New Graphs: Transitions: 2 + main_i, main_j -> 1 + main_j, rest remain the same}> 1 + main_i, main_j -> -1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001773s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.161606s [34252 : 34789] [34252 : 34790] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102637s Time used: 4.10123 [34252 : 35053] [34252 : 35057] Successful child: 35053 Program does NOT terminate