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_i -> 3}> = 3))> = 3)> 5)> 5))> (main_i + 3)}> 10)> 10))> (main_i - 2)}> (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, main_i -> 3}> = 3)> = 3))> 5)> 5))> (main_i + 3)}> 10)> 10))> (main_i - 2)}> (main_i + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: 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: = 3) /\ (main_i > 5), par{main_i -> (main_i + 3)}> = 3) /\ not((main_i > 5)) /\ not((main_i > 10)), par{main_i -> (main_i + 1)}> = 3))> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 3 + 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 ) ( 14 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.263733 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001369s Ranking function: 6 - main_i New Graphs: Transitions: 3 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000385s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001160s [34385 : 34387] [34385 : 34388] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008259s Time used: 0.007883 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000436s Time used: 1.00031 LOG: SAT solveNonLinear - Elapsed time: 1.008695s Cost: 1; Total time: 1.0082 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3 + 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 Strengthening transition (result): 3 + main_i, rest remain the same}> Quasi-ranking function: 50000 - main_i New Graphs: Transitions: 3 + main_i, 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.001204s [34385 : 34392] [34385 : 34393] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102558s Time used: 4.10109 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014561s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.014667s Cannot prove unreachability [34385 : 34397] [34385 : 34401] Successful child: 34397 Program does NOT terminate