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