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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> = 0)> = 0))> 0))> 0)> ((main_x + main_x) + main_y), main_y -> (main_y + 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> = 0)> = 0))> 0)> 0))> ((main_x + main_x) + main_y), main_y -> (main_y + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 8, 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, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0)> = 0))> 0), par{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y + 1)}> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 8, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002092 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000381s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001041s [29738 : 29740] [29738 : 29741] Successful child: 29740 [ 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_x + main_y, main_y -> 1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 1 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000260s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000313s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: main_x <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000365s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000973s [29738 : 29745] [29738 : 29746] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017764s Time used: 0.017252 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026193s Time used: 0.02619 LOG: SAT solveNonLinear - Elapsed time: 0.043957s Cost: 1; Total time: 0.043442 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + main_x + main_y [ 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_x + main_y, main_y -> 1 + main_y, 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_x + main_y, main_y -> 1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x - 2*main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000425s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002885s [29738 : 29750] [29738 : 29751] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005181s Time used: 0.004937 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010370s Time used: 0.010368 LOG: SAT solveNonLinear - Elapsed time: 0.015551s Cost: 1; Total time: 0.015305 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + main_x + main_y [ 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_x + main_y, main_y -> 1 + main_y, 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_x + main_y, main_y -> 1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000325s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001892s [29738 : 29755] [29738 : 29756] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005071s Time used: 0.004799 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009734s Time used: 0.009732 LOG: SAT solveNonLinear - Elapsed time: 0.014805s Cost: 1; Total time: 0.014531 Quasi-ranking function: 50000 - main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000369s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004371s [29738 : 29920] [29738 : 29921] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005242s Time used: 0.004957 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009645s Time used: 0.009643 LOG: SAT solveNonLinear - Elapsed time: 0.014887s Cost: 1; Total time: 0.0146 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + main_x + main_y [ 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_x + main_y, main_y -> 1 + main_y, 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_x + main_y, main_y -> 1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x + main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000406s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002013s [29738 : 29925] [29738 : 29926] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006536s Time used: 0.006292 [29738 : 29930] [29738 : 29934] Successful child: 29930 Program does NOT terminate