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), main_up -> 0}> = 10)> = 10))> 0}> 1}> = 1)> = 1))> (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, main_up -> 0}> = 10)> = 10))> 0}> 1}> = 1)> = 1))> (main_i + 1)}> (main_i - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 17, 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, ()] | i | local variable | integer | | up | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 10) /\ not((main_i <= 0)) /\ not((0 >= 1)), par{main_i -> (main_i - 1), main_up -> 0}> = 10)) /\ (main_i <= 0) /\ (1 >= 1), par{main_i -> (main_i + 1), main_up -> 1}> = 10)) /\ not((main_i <= 0)) /\ (main_up >= 1), par{main_i -> (main_i + 1)}> = 10)) /\ not((main_i <= 0)) /\ not((main_up >= 1)), par{main_i -> (main_i - 1)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 17, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + main_i, main_up -> 0, rest remain the same}> 1 + main_i, main_up -> 1, rest remain the same}> 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_up Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 17 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004964 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001024s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009130s [25251 : 25253] [25251 : 25254] Successful child: 25253 [ 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, main_up -> 0, 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, main_up -> 1, 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}> 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_i, main_up -> 0, 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, main_up -> 1, 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}> 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.000246s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000287s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i <= 0 , Narrowing transition: -1 + main_i, main_up -> 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, main_up -> 1, rest remain the same}> LOG: Narrow transition size 1 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, main_up -> 0, rest remain the same}> 1 + main_i, main_up -> 1, rest remain the same}> 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_up Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000646s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008555s [25251 : 25258] [25251 : 25259] Successful child: 25258 [ 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, main_up -> 0, 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, main_up -> 1, 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}> 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_i, main_up -> 0, 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, main_up -> 1, 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}> New Graphs: LOG: CALL check - Post:11 <= main_i - Process 2 * Exit transition: * Postcondition : 11 <= main_i LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000347s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000386s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 11 <= main_i , Narrowing transition: -1 + main_i, main_up -> 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, main_up -> 1, rest remain the same}> LOG: Narrow transition size 1 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, main_up -> 0, rest remain the same}> 1 + main_i, main_up -> 1, rest remain the same}> 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_up Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008535s [25251 : 25263] [25251 : 25264] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084630s Time used: 0.083094 [25251 : 25268] [25251 : 25272] Successful child: 25268 Program does NOT terminate