5.25/4.24 NO 5.25/4.24 5.25/4.24 Solver Timeout: 4 5.25/4.24 Global Timeout: 300 5.25/4.24 Maximum number of concurrent processes: 900 5.25/4.24 ******************************************************************************************* 5.25/4.24 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 5.25/4.24 ******************************************************************************************* 5.25/4.24 5.25/4.24 5.25/4.24 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 5.25/4.24 5.25/4.24 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 5.25/4.24 + + 5.25/4.24 Init Location: 0 5.25/4.24 Transitions: 5.25/4.24 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}> 5.25/4.24 5.25/4.24 = 1))> 5.25/4.24 = 1)> 5.25/4.24 (main_i - ¿functionCall(__VERIFIER_nondet_int)), main_r -> (¿functionCall(__VERIFIER_nondet_int) + 1), main_j -> (main_j + main_r)}> 5.25/4.24 5.25/4.24 0}> 5.25/4.24 5.25/4.24 Fresh variables: 5.25/4.24 5.25/4.24 Undef variables: 5.25/4.24 5.25/4.24 Abstraction variables: 5.25/4.24 5.25/4.24 Exit nodes: 5.25/4.24 5.25/4.24 Accepting locations: 5.25/4.24 5.25/4.24 Asserts: 5.25/4.24 5.25/4.24 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 5.25/4.24 5.25/4.24 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 5.25/4.24 5.25/4.24 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 5.25/4.24 5.25/4.24 Init Location: 0 5.25/4.24 Transitions: 5.25/4.24 0}> 5.25/4.24 ¿functionCall(__VERIFIER_nondet_int)}> 5.25/4.24 varCall_1}> 5.25/4.24 ¿functionCall(__VERIFIER_nondet_int)}> 5.25/4.24 varCall_2}> 5.25/4.24 5.25/4.24 = 1)> 5.25/4.24 = 1))> 5.25/4.24 ¿functionCall(__VERIFIER_nondet_int)}> 5.25/4.24 (main_i - varCall_3)}> 5.25/4.24 ¿functionCall(__VERIFIER_nondet_int)}> 5.25/4.24 (varCall_4 + 1), main_j -> (main_j + main_r)}> 5.25/4.24 5.25/4.24 0}> 5.25/4.24 5.25/4.24 Fresh variables: 5.25/4.24 5.25/4.24 Undef variables: 5.25/4.24 5.25/4.24 Abstraction variables: 5.25/4.24 5.25/4.24 Exit nodes: 5.25/4.24 6, 5.25/4.24 Accepting locations: 5.25/4.24 5.25/4.24 Asserts: 5.25/4.24 5.25/4.24 + + 5.25/4.24 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 5.25/4.24 5.25/4.24 5.25/4.24 Function Return and Parameters Information [2 functions]: 5.25/4.24 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 5.25/4.24 __VERIFIER_nondet_int__func_return_ [function result] : int 5.25/4.24 function name: main [1 return + 0 parameters] demangled: main 5.25/4.24 main__func_return_ [function result] : int 5.25/4.24 5.25/4.24 5.25/4.24 AST Ident Scanner Information [5 idents]: 5.25/4.24 __VERIFIER_nondet_int | function | [integer, ()] | | 5.25/4.24 main | function | [integer, ()] | 5.25/4.24 i | local variable | integer | | 5.25/4.24 j | local variable | integer | | 5.25/4.24 r | local variable | integer | | 5.25/4.24 5.25/4.24 Main function: main 5.25/4.24 Preprocessed LLVMGraph 5.25/4.24 Init Location: 0 5.25/4.24 Transitions: 5.25/4.24 5.25/4.24 = 1), par{main_i -> (main_i - undef7), main_j -> (main_j + (undef8 + 1))}> 5.25/4.24 = 1))> 5.25/4.24 5.25/4.24 Fresh variables: 5.25/4.24 undef5, undef6, undef7, undef8, 5.25/4.24 5.25/4.24 Undef variables: 5.25/4.24 undef5, undef6, undef7, undef8, 5.25/4.24 5.25/4.24 Abstraction variables: 5.25/4.24 5.25/4.24 Exit nodes: 5.25/4.24 6, 5.25/4.24 Accepting locations: 5.25/4.24 5.25/4.24 Asserts: 5.25/4.24 5.25/4.24 ************************************************************* 5.25/4.24 ******************************************************************************************* 5.25/4.24 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.25/4.24 ******************************************************************************************* 5.25/4.24 5.25/4.24 Init Location: 0 5.25/4.24 Graph 0: 5.25/4.24 Transitions: 5.25/4.24 Variables: 5.25/4.24 5.25/4.24 Graph 1: 5.25/4.24 Transitions: 5.25/4.24 main_i - undef7, main_j -> 1 + main_j + undef8, rest remain the same}> 5.25/4.24 Variables: 5.25/4.24 main_i, main_j 5.25/4.24 5.25/4.24 Graph 2: 5.25/4.24 Transitions: 5.25/4.24 Variables: 5.25/4.24 5.25/4.24 Precedence: 5.25/4.24 Graph 0 5.25/4.24 5.25/4.24 Graph 1 5.25/4.24 5.25/4.24 5.25/4.24 Graph 2 5.25/4.24 5.25/4.24 5.25/4.24 Map Locations to Subgraph: 5.25/4.24 ( 0 , 0 ) 5.25/4.24 ( 2 , 1 ) 5.25/4.24 ( 6 , 2 ) 5.25/4.24 5.25/4.24 ******************************************************************************************* 5.25/4.24 ******************************** CHECKING ASSERTIONS ******************************** 5.25/4.24 ******************************************************************************************* 5.25/4.24 5.25/4.24 Proving termination of subgraph 0 5.25/4.24 Proving termination of subgraph 1 5.25/4.24 Checking unfeasibility... 5.25/4.24 Time used: 0.001926 5.25/4.24 5.25/4.24 Checking conditional termination of SCC {l2}... 5.25/4.24 5.25/4.24 LOG: CALL solveLinear 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear - Elapsed time: 0.000837s 5.25/4.24 5.25/4.24 LOG: CALL solveLinear 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear - Elapsed time: 0.001888s 5.25/4.24 [30381 : 30383] 5.25/4.24 [30381 : 30384] 5.25/4.24 Successful child: 30383 5.25/4.24 [ Invariant Graph ] 5.25/4.24 Strengthening and disabling transitions... 5.25/4.24 5.25/4.24 LOG: CALL solverLinear in Graph for feasibility 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear in Graph for feasibility 5.25/4.24 It's unfeasible. Removing transition: 5.25/4.24 main_i - undef7, main_j -> 1 + main_j + undef8, rest remain the same}> 5.25/4.24 [ Termination Graph ] 5.25/4.24 Strengthening and disabling transitions... 5.25/4.24 > It's unfeasible. Removing transition: 5.25/4.24 main_i - undef7, main_j -> 1 + main_j + undef8, rest remain the same}> 5.25/4.24 New Graphs: 5.25/4.24 5.25/4.24 LOG: CALL check - Post:main_i <= main_j - Process 1 5.25/4.24 * Exit transition: 5.25/4.24 * Postcondition : main_i <= main_j 5.25/4.24 5.25/4.24 LOG: CALL solveLinear 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear - Elapsed time: 0.000496s 5.25/4.24 > Postcondition is not implied! 5.25/4.24 5.25/4.24 LOG: RETURN check - Elapsed time: 0.000596s 5.25/4.24 INVARIANTS: 5.25/4.24 2: 5.25/4.24 Quasi-INVARIANTS to narrow Graph: 5.25/4.24 2: main_i <= main_j , 5.25/4.24 Narrowing transition: 5.25/4.24 main_i - undef7, main_j -> 1 + main_j + undef8, rest remain the same}> 5.25/4.24 5.25/4.24 LOG: Narrow transition size 1 5.25/4.24 invGraph after Narrowing: 5.25/4.24 Transitions: 5.25/4.24 main_i - undef7, main_j -> 1 + main_j + undef8, rest remain the same}> 5.25/4.24 Variables: 5.25/4.24 main_i, main_j 5.25/4.24 Checking conditional termination of SCC {l2}... 5.25/4.24 5.25/4.24 LOG: CALL solveLinear 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear - Elapsed time: 0.000812s 5.25/4.24 5.25/4.24 LOG: CALL solveLinear 5.25/4.24 5.25/4.24 LOG: RETURN solveLinear - Elapsed time: 0.002022s 5.25/4.24 [30381 : 30388] 5.25/4.24 [30381 : 30389] 5.25/4.24 Solving with 1 template(s). 5.25/4.24 5.25/4.24 LOG: CALL solveNonLinearGetFirstSolution 5.25/4.24 5.25/4.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005740s 5.25/4.24 Time used: 0.005473 5.25/4.24 5.25/4.24 [30381 : 30393] 5.25/4.24 [30381 : 30397] 5.25/4.24 Successful child: 30393 5.25/4.24 5.25/4.24 Program does NOT terminate 5.25/4.24 EOF