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