0.06/0.06 YES 0.06/0.06 0.06/0.06 Solver Timeout: 4 0.06/0.06 Global Timeout: 300 0.06/0.06 Maximum number of concurrent processes: 900 0.06/0.06 ******************************************************************************************* 0.06/0.06 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.06/0.06 ******************************************************************************************* 0.06/0.06 0.06/0.06 0.06/0.06 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.06/0.06 0.06/0.06 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.06/0.06 + + 0.06/0.06 Init Location: 0 0.06/0.06 Transitions: 0.06/0.06 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}> 0.06/0.06 0.06/0.06 0.06/0.06 0.06/0.06 0}> 0.06/0.06 0.06/0.06 2))> 0.06/0.06 2)> 0.06/0.06 0.06/0.06 0.06/0.06 (main_j + 1)}> 0.06/0.06 0.06/0.06 (main_i + 1)}> 0.06/0.06 0.06/0.06 0}> 0.06/0.06 0.06/0.06 Fresh variables: 0.06/0.06 0.06/0.06 Undef variables: 0.06/0.06 0.06/0.06 Abstraction variables: 0.06/0.06 0.06/0.06 Exit nodes: 0.06/0.06 0.06/0.06 Accepting locations: 0.06/0.06 0.06/0.06 Asserts: 0.06/0.06 0.06/0.06 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.06/0.06 0.06/0.06 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.06/0.06 0.06/0.06 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.06/0.06 0.06/0.06 Init Location: 0 0.06/0.06 Transitions: 0.06/0.06 0}> 0.06/0.06 ¿functionCall(__VERIFIER_nondet_int)}> 0.06/0.06 varCall_1}> 0.06/0.06 ¿functionCall(__VERIFIER_nondet_int)}> 0.06/0.06 varCall_2}> 0.06/0.06 0.06/0.06 0.06/0.06 0.06/0.06 0}> 0.06/0.06 0.06/0.06 2)> 0.06/0.06 2))> 0.06/0.06 0.06/0.06 0.06/0.06 (main_j + 1)}> 0.06/0.06 0.06/0.06 (main_i + 1)}> 0.06/0.06 0.06/0.06 0}> 0.06/0.06 0.06/0.06 Fresh variables: 0.06/0.06 0.06/0.06 Undef variables: 0.06/0.06 0.06/0.06 Abstraction variables: 0.06/0.06 0.06/0.06 Exit nodes: 0.06/0.06 12, 0.06/0.06 Accepting locations: 0.06/0.06 0.06/0.06 Asserts: 0.06/0.06 0.06/0.06 + + 0.06/0.06 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.06/0.06 0.06/0.06 0.06/0.06 Function Return and Parameters Information [2 functions]: 0.06/0.06 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.06/0.06 __VERIFIER_nondet_int__func_return_ [function result] : int 0.06/0.06 function name: main [1 return + 0 parameters] demangled: main 0.06/0.06 main__func_return_ [function result] : int 0.06/0.06 0.06/0.06 0.06/0.06 AST Ident Scanner Information [4 idents]: 0.06/0.06 __VERIFIER_nondet_int | function | [integer, ()] | | 0.06/0.06 main | function | [integer, ()] | 0.06/0.06 i | local variable | integer | | 0.06/0.06 j | local variable | integer | | 0.06/0.06 0.06/0.06 Main function: main 0.06/0.06 Preprocessed LLVMGraph 0.06/0.06 Init Location: 0 0.06/0.06 Transitions: 0.06/0.06 0}> 0.06/0.06 undef4}> 0.06/0.06 2) /\ (main_j <= 9), par{main_j -> (main_j + 1)}> 0.06/0.06 2) /\ not((main_j <= 9)) /\ ((main_i + 1) < 5), par{main_i -> (main_i + 1), main_j -> 0}> 0.06/0.06 2) /\ not((main_j <= 9)) /\ not(((main_i + 1) < 5)), par{main_i -> (main_i + 1)}> 0.06/0.06 2)) /\ ((main_i + 1) < 5), par{main_i -> (main_i + 1), main_j -> 0}> 0.06/0.06 0.06/0.06 Fresh variables: 0.06/0.06 undef3, undef4, 0.06/0.06 0.06/0.06 Undef variables: 0.06/0.06 undef3, undef4, 0.06/0.06 0.06/0.06 Abstraction variables: 0.06/0.06 0.06/0.06 Exit nodes: 0.06/0.06 12, 0.06/0.06 Accepting locations: 0.06/0.06 0.06/0.06 Asserts: 0.06/0.06 0.06/0.06 ************************************************************* 0.06/0.06 ******************************************************************************************* 0.06/0.06 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.06/0.06 ******************************************************************************************* 0.06/0.06 0.06/0.06 Init Location: 0 0.06/0.06 Graph 0: 0.06/0.06 Transitions: 0.06/0.06 Variables: 0.06/0.06 0.06/0.06 Graph 1: 0.06/0.06 Transitions: 0.06/0.06 1 + main_j, rest remain the same}> 0.06/0.06 1 + main_i, main_j -> 0, rest remain the same}> 0.06/0.06 1 + main_i, main_j -> 0, rest remain the same}> 0.06/0.06 Variables: 0.06/0.06 main_i, main_j 0.06/0.06 0.06/0.06 Graph 2: 0.06/0.06 Transitions: 0.06/0.06 Variables: 0.06/0.06 0.06/0.06 Precedence: 0.06/0.06 Graph 0 0.06/0.06 0.06/0.06 Graph 1 0.06/0.06 0, rest remain the same}> 0.06/0.06 0.06/0.06 Graph 2 0.06/0.06 undef4, rest remain the same}> 0.06/0.06 1 + main_i, rest remain the same}> 0.06/0.06 0.06/0.06 Map Locations to Subgraph: 0.06/0.06 ( 0 , 0 ) 0.06/0.06 ( 5 , 1 ) 0.06/0.06 ( 12 , 2 ) 0.06/0.06 0.06/0.06 ******************************************************************************************* 0.06/0.06 ******************************** CHECKING ASSERTIONS ******************************** 0.06/0.06 ******************************************************************************************* 0.06/0.06 0.06/0.06 Proving termination of subgraph 0 0.06/0.06 Proving termination of subgraph 1 0.06/0.06 Checking unfeasibility... 0.06/0.06 Time used: 0.033719 0.06/0.06 0.06/0.06 Checking conditional termination of SCC {l5}... 0.06/0.06 0.06/0.06 LOG: CALL solveLinear 0.06/0.06 0.06/0.06 LOG: RETURN solveLinear - Elapsed time: 0.001596s 0.06/0.06 Ranking function: 3 - main_i 0.06/0.06 New Graphs: 0.06/0.06 Transitions: 0.06/0.06 1 + main_j, rest remain the same}> 0.06/0.06 Variables: 0.06/0.06 main_i, main_j 0.06/0.06 Checking conditional termination of SCC {l5}... 0.06/0.06 0.06/0.06 LOG: CALL solveLinear 0.06/0.06 0.06/0.06 LOG: RETURN solveLinear - Elapsed time: 0.000611s 0.06/0.06 Ranking function: 9 - main_j 0.06/0.06 New Graphs: 0.06/0.06 Proving termination of subgraph 2 0.06/0.06 Analyzing SCC {l12}... 0.06/0.06 No cycles found. 0.06/0.06 0.06/0.06 Program Terminates 0.06/0.06 EOF