NO Solver Timeout: 4 Global Timeout: 60 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_sum -> 0}> (main_sum + main_n), main_n -> (main_n - 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_sum -> 0}> (main_sum + main_n), main_n -> (main_n - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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, ()] | n | local variable | integer | | sum | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: (main_n - 1), main_sum -> (main_sum + main_n)}> 0), par{main_n -> (main_n - 1), main_sum -> (main_sum + main_n)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003098 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000913s Ranking function: 1 + main_n New Graphs: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000444s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001503s [54526 : 54528] [54526 : 54529] Successful child: 54528 [ 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_n, main_sum -> main_n + main_sum, 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_n - Process 1 * Exit transition: * Postcondition : 0 <= main_n LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000465s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000557s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_n , Narrowing transition: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> invGraph after Narrowing: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000484s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001615s [54526 : 54533] [54526 : 54534] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008371s Time used: 0.008042 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020344s Time used: 0.020126 LOG: SAT solveNonLinear - Elapsed time: 0.028714s Cost: 1; Total time: 0.028168 Termination implied by a set of invariant(s): Invariant at l2: main_sum <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_n, main_sum -> main_n + main_sum, 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Quasi-ranking function: 50000 + main_sum New Graphs: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000543s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002066s [54526 : 54538] [54526 : 54539] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008947s Time used: 0.008525 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016700s Time used: 0.016694 LOG: SAT solveNonLinear - Elapsed time: 0.025647s Cost: 1; Total time: 0.025219 Termination implied by a set of invariant(s): Invariant at l2: main_sum <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_n, main_sum -> main_n + main_sum, 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Quasi-ranking function: 50000 - main_n + 2*main_sum New Graphs: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000645s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003175s [54526 : 54543] [54526 : 54544] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010091s Time used: 0.009613 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022351s Time used: 0.022344 LOG: SAT solveNonLinear - Elapsed time: 0.032442s Cost: 1; Total time: 0.031957 Termination implied by a set of invariant(s): Invariant at l2: main_sum <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_n, main_sum -> main_n + main_sum, 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Quasi-ranking function: 50000 + main_n + main_sum New Graphs: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000725s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004318s [54526 : 54548] [54526 : 54549] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010388s Time used: 0.009879 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026159s Time used: 0.026152 LOG: SAT solveNonLinear - Elapsed time: 0.036546s Cost: 1; Total time: 0.036031 Termination implied by a set of invariant(s): Invariant at l2: main_n <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_n, main_sum -> main_n + main_sum, 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 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Quasi-ranking function: 50000 + main_n New Graphs: Transitions: -1 + main_n, main_sum -> main_n + main_sum, rest remain the same}> Variables: main_n, main_sum Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000725s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003980s [54526 : 54553] [54526 : 54554] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010681s Time used: 0.010189 [54526 : 54558] [54526 : 54562] Successful child: 54558 Program does NOT terminate