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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> (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}> (main_x + main_y), main_y -> (main_y - 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, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: (main_x + main_y), main_y -> (main_y - 1)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 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 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001899 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000480s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001347s [29002 : 29004] [29002 : 29005] Successful child: 29004 [ 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: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 <= main_x - Process 1 * Exit transition: * Postcondition : 1 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000480s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000570s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000464s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001482s [29002 : 29009] [29002 : 29010] Successful child: 29009 [ 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: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_x - Process 2 * Exit transition: * Postcondition : 0 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000573s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000670s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000468s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001471s [29002 : 29014] [29002 : 29015] Successful child: 29014 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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): main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Ranking function: main_y New Graphs: LOG: CALL check - Post:0 <= main_x + main_y - Process 3 * Exit transition: * Postcondition : 0 <= main_x + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000546s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000648s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000571s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001939s [29002 : 29019] [29002 : 29020] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007027s Time used: 0.006624 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016101s Time used: 0.016094 LOG: SAT solveNonLinear - Elapsed time: 0.023128s Cost: 1; Total time: 0.022718 Quasi-ranking function: 50000 + main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002694s [29002 : 29024] [29002 : 29025] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008530s Time used: 0.008064 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015243s Time used: 0.015237 LOG: SAT solveNonLinear - Elapsed time: 0.023774s Cost: 1; Total time: 0.023301 Quasi-ranking function: 50000 + main_x + 2*main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000718s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004791s [29002 : 29029] [29002 : 29030] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011531s Time used: 0.010981 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017758s Time used: 0.01775 LOG: SAT solveNonLinear - Elapsed time: 0.029289s Cost: 1; Total time: 0.028731 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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): main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 + main_x New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000736s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008136s [29002 : 29035] [29002 : 29036] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010329s Time used: 0.009778 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017137s Time used: 0.01713 LOG: SAT solveNonLinear - Elapsed time: 0.027466s Cost: 1; Total time: 0.026908 Quasi-ranking function: 50000 + main_x - main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000895s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004464s [29002 : 29040] [29002 : 29041] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011512s Time used: 0.011063 [29002 : 29045] [29002 : 29049] Successful child: 29045 Program does NOT terminate