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)}> 0))> 0)> 3)> 3))> (main_i + 1)}> (main_i - 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}> 0)> 0))> 3)> 3))> (main_i + 1)}> (main_i - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, 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 [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_i > 3), par{main_i -> (main_i + 1)}> 0) /\ not((main_i > 3)), par{main_i -> (main_i - 1)}> 0))> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001604 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000540s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002344s Piecewise ranking function: min(-5 + 5*main_i,39 - 6*main_i) New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000293s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000830s [14109 : 14111] [14109 : 14112] Successful child: 14111 [ 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_i, 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, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_i, 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.000261s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000303s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i <= 0 , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000489s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002354s Piecewise ranking function: min(-5 + 5*main_i,39 - 6*main_i) New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000257s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000708s [14109 : 14116] [14109 : 14117] Successful child: 14116 [ 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_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 3 - Process 2 * Exit transition: * Postcondition : main_i <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000244s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000291s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 3 , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + main_i, rest remain the same}> invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000248s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000735s [14109 : 14121] [14109 : 14122] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002285s Time used: 0.002128 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007983s Time used: 0.007982 LOG: SAT solveNonLinear - Elapsed time: 0.010269s Cost: 1; Total time: 0.01011 Quasi-ranking function: 50000 - main_i New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000229s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000662s [14109 : 14126] [14109 : 14127] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002421s Time used: 0.00225 [14109 : 14131] [14109 : 14135] Successful child: 14131 Program does NOT terminate