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