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)}> ~(5)}> 30)> 30))> 35}> (main_i - 1)}> 0}> 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}> ~(5)}> 30)> 30))> 35}> (main_i - 1)}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 19, 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: ~(5)}> 0}> 0) /\ (~(5) <= main_i) /\ (main_i <= 35) /\ not((main_i < 0)) /\ (main_i > 30), par{main_i -> 35}> 0) /\ (~(5) <= main_i) /\ (main_i <= 35) /\ not((main_i < 0)) /\ not((main_i > 30)), par{main_i -> (main_i - 1)}> 0) /\ (~(5) <= main_i) /\ not((main_i <= 35)), par{main_i -> 0}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 19, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -5, rest remain the same}> 0, rest remain the same}> 35, rest remain the same}> -1 + main_i, rest remain the same}> 0, 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 ) ( 19 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004865 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001216s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032559s [29686 : 29688] [29686 : 29689] Successful child: 29688 [ 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> New Graphs: Transitions: 35, rest remain the same}> -1 + main_i, rest remain the same}> 0, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000695s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003704s Piecewise ranking function: min(-61 + 61*main_i,1829) New Graphs: Transitions: 35, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000243s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000769s [29686 : 29693] [29686 : 29694] Successful child: 29693 [ 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: 35, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_i - Process 1 * Exit transition: * Postcondition : 0 <= main_i LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000240s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000273s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_i , LOG: CALL check - Post:main_i <= 15 - Process 2 * Exit transition: * Postcondition : main_i <= 15 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000232s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000260s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 15 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, 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.000569s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005471s Piecewise ranking function: min(140,20 + 4*main_i) New Graphs: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000419s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001689s [29686 : 29698] [29686 : 29699] Successful child: 29698 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Transitions: -5, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000262s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000802s [29686 : 29703] [29686 : 29704] Successful child: 29703 [ 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: -5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -5, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 8 - Process 3 * Exit transition: * Postcondition : main_i <= 8 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000342s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000380s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 8 , LOG: CALL check - Post:6 + main_i <= 0 - Process 4 * Exit transition: * Postcondition : 6 + main_i <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000276s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000310s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 6 + main_i <= 0 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, 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.000593s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005517s Piecewise ranking function: min(140,20 + 4*main_i) New Graphs: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000414s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001688s [29686 : 29708] [29686 : 29709] Successful child: 29708 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Transitions: -5, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000365s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001133s [29686 : 29713] [29686 : 29714] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062217s Time used: 0.061612 [29686 : 29718] [29686 : 29722] Successful child: 29722 Program does NOT terminate