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.048986 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001614s 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.000910s 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.000516s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014061s [10018 : 10020] [10018 : 10021] Successful child: 10020 [ 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.000306s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000341s 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.001377s 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.000970s 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.000519s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014284s [10018 : 10025] [10018 : 10026] Successful child: 10025 [ 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.000282s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000325s 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.001899s 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.001493s 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.001103s 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.000536s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022630s [10018 : 10030] [10018 : 10031] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047876s Time used: 0.046729 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000506s Time used: 1.00026 LOG: SAT solveNonLinear - Elapsed time: 1.048383s Cost: 1; Total time: 1.04699 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.000696s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.038250s [10018 : 10035] [10018 : 10036] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060086s Time used: 0.058399 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000429s Time used: 1.00042 LOG: SAT solveNonLinear - Elapsed time: 1.060514s Cost: 1; Total time: 1.05882 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.000737s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034569s [10018 : 10040] [10018 : 10041] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032728s Time used: 0.031977 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.024252s Time used: 1.02424 LOG: SAT solveNonLinear - Elapsed time: 1.056979s Cost: 1; Total time: 1.05622 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.000857s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.084909s [10018 : 10045] [10018 : 10046] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102775s Time used: 4.10056 [10018 : 10050] [10018 : 10052] Successful child: 10050 Program does NOT terminate