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_c -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> (main_x - main_c), main_c -> (main_c - 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))> (main_x - main_c), main_c -> (main_c - 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 | | c | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0), par{main_x -> (main_x - main_c), main_c -> (main_c - 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: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c 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.0023 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001108s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001834s [6708 : 6710] [6708 : 6711] Successful child: 6710 [ 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_c, main_c -> -1 + main_c, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x + main_c <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x + main_c <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000541s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000652s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + main_x + main_c <= 0 , Narrowing transition: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001117s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001949s [6708 : 6715] [6708 : 6716] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008507s Time used: 0.008143 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019938s Time used: 0.019933 LOG: SAT solveNonLinear - Elapsed time: 0.028445s Cost: 1; Total time: 0.028076 Termination implied by a set of invariant(s): Invariant at l3: main_c <= 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_c, main_c -> -1 + main_c, 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_c, main_c -> -1 + main_c, rest remain the same}> Quasi-ranking function: 50000 - main_x + main_c New Graphs: Transitions: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000615s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003173s [6708 : 6723] [6708 : 6724] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008704s Time used: 0.008252 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017478s Time used: 0.017473 LOG: SAT solveNonLinear - Elapsed time: 0.026182s Cost: 1; Total time: 0.025725 Termination implied by a set of invariant(s): Invariant at l3: main_c <= 1 [ 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_c, main_c -> -1 + main_c, 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_c, main_c -> -1 + main_c, rest remain the same}> Quasi-ranking function: 50000 + main_c New Graphs: Transitions: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000630s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003077s [6708 : 6728] [6708 : 6729] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009871s Time used: 0.009345 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018923s Time used: 0.018919 LOG: SAT solveNonLinear - Elapsed time: 0.028793s Cost: 1; Total time: 0.028264 Quasi-ranking function: 50000 - main_x - main_c New Graphs: Transitions: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000649s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005828s [6708 : 6733] [6708 : 6734] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010930s Time used: 0.010388 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021166s Time used: 0.021162 LOG: SAT solveNonLinear - Elapsed time: 0.032096s Cost: 1; Total time: 0.03155 Termination implied by a set of invariant(s): Invariant at l3: main_c <= main_x [ 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_c, main_c -> -1 + main_c, 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_c, main_c -> -1 + main_c, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: main_x - main_c, main_c -> -1 + main_c, rest remain the same}> Variables: main_x, main_c Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003244s [6708 : 6738] [6708 : 6739] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011219s Time used: 0.01087 [6708 : 6743] [6708 : 6747] Successful child: 6743 Program does NOT terminate