18.77/8.41 NO 18.77/8.41 18.77/8.42 Solver Timeout: 4 18.77/8.42 Global Timeout: 300 18.77/8.42 Maximum number of concurrent processes: 900 18.77/8.42 ******************************************************************************************* 18.77/8.42 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 18.77/8.42 ******************************************************************************************* 18.77/8.42 18.77/8.42 18.77/8.42 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 18.77/8.42 18.77/8.42 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 18.77/8.42 + + 18.77/8.42 Init Location: 0 18.77/8.42 Transitions: 18.77/8.42 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 18.77/8.42 18.77/8.42 1))> 18.77/8.42 1)> 18.77/8.42 (2 * main_x)}> 18.77/8.42 18.77/8.42 0}> 18.77/8.42 18.77/8.42 Fresh variables: 18.77/8.42 18.77/8.42 Undef variables: 18.77/8.42 18.77/8.42 Abstraction variables: 18.77/8.42 18.77/8.42 Exit nodes: 18.77/8.42 18.77/8.42 Accepting locations: 18.77/8.42 18.77/8.42 Asserts: 18.77/8.42 18.77/8.42 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 18.77/8.42 18.77/8.42 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 18.77/8.42 18.77/8.42 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 18.77/8.42 18.77/8.42 Init Location: 0 18.77/8.42 Transitions: 18.77/8.42 0}> 18.77/8.42 ¿functionCall(__VERIFIER_nondet_int)}> 18.77/8.42 varCall_1}> 18.77/8.42 18.77/8.42 1)> 18.77/8.42 1))> 18.77/8.42 (2 * main_x)}> 18.77/8.42 18.77/8.42 0}> 18.77/8.42 18.77/8.42 Fresh variables: 18.77/8.42 18.77/8.42 Undef variables: 18.77/8.42 18.77/8.42 Abstraction variables: 18.77/8.42 18.77/8.42 Exit nodes: 18.77/8.42 6, 18.77/8.42 Accepting locations: 18.77/8.42 18.77/8.42 Asserts: 18.77/8.42 18.77/8.42 + + 18.77/8.42 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 18.77/8.42 18.77/8.42 18.77/8.42 Function Return and Parameters Information [2 functions]: 18.77/8.42 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 18.77/8.42 __VERIFIER_nondet_int__func_return_ [function result] : int 18.77/8.42 function name: main [1 return + 0 parameters] demangled: main 18.77/8.42 main__func_return_ [function result] : int 18.77/8.42 18.77/8.42 18.77/8.42 AST Ident Scanner Information [3 idents]: 18.77/8.42 __VERIFIER_nondet_int | function | [integer, ()] | | 18.77/8.42 main | function | [integer, ()] | 18.77/8.42 x | local variable | integer | | 18.77/8.42 18.77/8.42 Main function: main 18.77/8.42 Preprocessed LLVMGraph 18.77/8.42 Init Location: 0 18.77/8.42 Transitions: 18.77/8.42 18.77/8.42 1), par{main_x -> (2 * main_x)}> 18.77/8.42 1))> 18.77/8.42 18.77/8.42 Fresh variables: 18.77/8.42 undef2, 18.77/8.42 18.77/8.42 Undef variables: 18.77/8.42 undef2, 18.77/8.42 18.77/8.42 Abstraction variables: 18.77/8.42 18.77/8.42 Exit nodes: 18.77/8.42 6, 18.77/8.42 Accepting locations: 18.77/8.42 18.77/8.42 Asserts: 18.77/8.42 18.77/8.42 ************************************************************* 18.77/8.42 ******************************************************************************************* 18.77/8.42 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 18.77/8.42 ******************************************************************************************* 18.77/8.42 18.77/8.42 Init Location: 0 18.77/8.42 Graph 0: 18.77/8.42 Transitions: 18.77/8.42 Variables: 18.77/8.42 18.77/8.42 Graph 1: 18.77/8.42 Transitions: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 Variables: 18.77/8.42 main_x 18.77/8.42 18.77/8.42 Graph 2: 18.77/8.42 Transitions: 18.77/8.42 Variables: 18.77/8.42 18.77/8.42 Precedence: 18.77/8.42 Graph 0 18.77/8.42 18.77/8.42 Graph 1 18.77/8.42 18.77/8.42 18.77/8.42 Graph 2 18.77/8.42 18.77/8.42 18.77/8.42 Map Locations to Subgraph: 18.77/8.42 ( 0 , 0 ) 18.77/8.42 ( 2 , 1 ) 18.77/8.42 ( 6 , 2 ) 18.77/8.42 18.77/8.42 ******************************************************************************************* 18.77/8.42 ******************************** CHECKING ASSERTIONS ******************************** 18.77/8.42 ******************************************************************************************* 18.77/8.42 18.77/8.42 Proving termination of subgraph 0 18.77/8.42 Proving termination of subgraph 1 18.77/8.42 Checking unfeasibility... 18.77/8.42 Time used: 0.00147 18.77/8.42 18.77/8.42 Checking conditional termination of SCC {l2}... 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.000500s 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.001293s 18.77/8.42 [21350 : 21352] 18.77/8.42 [21350 : 21353] 18.77/8.42 Successful child: 21352 18.77/8.42 [ Invariant Graph ] 18.77/8.42 Strengthening and disabling transitions... 18.77/8.42 18.77/8.42 LOG: CALL solverLinear in Graph for feasibility 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear in Graph for feasibility 18.77/8.42 It's unfeasible. Removing transition: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 [ Termination Graph ] 18.77/8.42 Strengthening and disabling transitions... 18.77/8.42 > It's unfeasible. Removing transition: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 New Graphs: 18.77/8.42 18.77/8.42 LOG: CALL check - Post:main_x <= 1 - Process 1 18.77/8.42 * Exit transition: 18.77/8.42 * Postcondition : main_x <= 1 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.000358s 18.77/8.42 > Postcondition is not implied! 18.77/8.42 18.77/8.42 LOG: RETURN check - Elapsed time: 0.000435s 18.77/8.42 INVARIANTS: 18.77/8.42 2: 18.77/8.42 Quasi-INVARIANTS to narrow Graph: 18.77/8.42 2: main_x <= 1 , 18.77/8.42 Narrowing transition: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 18.77/8.42 LOG: Narrow transition size 1 18.77/8.42 invGraph after Narrowing: 18.77/8.42 Transitions: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 Variables: 18.77/8.42 main_x 18.77/8.42 Checking conditional termination of SCC {l2}... 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.000484s 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.001410s 18.77/8.42 [21350 : 21357] 18.77/8.42 [21350 : 21358] 18.77/8.42 Solving with 1 template(s). 18.77/8.42 18.77/8.42 LOG: CALL solveNonLinearGetFirstSolution 18.77/8.42 18.77/8.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005940s 18.77/8.42 Time used: 0.00563 18.77/8.42 Improving Solution with cost 1 ... 18.77/8.42 18.77/8.42 LOG: CALL solveNonLinearGetNextSolution 18.77/8.42 18.77/8.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016881s 18.77/8.42 Time used: 0.016875 18.77/8.42 18.77/8.42 LOG: SAT solveNonLinear - Elapsed time: 0.022821s 18.77/8.42 Cost: 1; Total time: 0.022505 18.77/8.42 Quasi-ranking function: 50000 - main_x 18.77/8.42 New Graphs: 18.77/8.42 Transitions: 18.77/8.42 2*main_x, rest remain the same}> 18.77/8.42 Variables: 18.77/8.42 main_x 18.77/8.42 Checking conditional termination of SCC {l2}... 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.000448s 18.77/8.42 18.77/8.42 LOG: CALL solveLinear 18.77/8.42 18.77/8.42 LOG: RETURN solveLinear - Elapsed time: 0.001330s 18.77/8.42 [21350 : 21362] 18.77/8.42 [21350 : 21363] 18.77/8.42 Solving with 1 template(s). 18.77/8.42 18.77/8.42 LOG: CALL solveNonLinearGetFirstSolution 18.77/8.42 18.77/8.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006135s 18.77/8.42 Time used: 0.005797 18.77/8.42 18.77/8.42 [21350 : 21367] 18.77/8.42 [21350 : 21371] 18.77/8.42 Successful child: 21367 18.77/8.42 18.77/8.42 Program does NOT terminate 18.77/8.42 EOF