21.59/9.40 NO 21.59/9.40 21.59/9.40 Solver Timeout: 4 21.59/9.40 Global Timeout: 300 21.59/9.40 Maximum number of concurrent processes: 900 21.59/9.40 ******************************************************************************************* 21.59/9.40 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 21.59/9.40 ******************************************************************************************* 21.59/9.40 21.59/9.40 21.59/9.40 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 21.59/9.40 21.59/9.40 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 21.59/9.40 + + 21.59/9.40 Init Location: 0 21.59/9.40 Transitions: 21.59/9.40 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 21.59/9.40 = 0))> 21.59/9.40 = 0)> 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 1)}> 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 2)}> 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 3)}> 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 4)}> 21.59/9.40 21.59/9.40 ~(1)}> 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 0}> 21.59/9.40 21.59/9.40 Fresh variables: 21.59/9.40 21.59/9.40 Undef variables: 21.59/9.40 21.59/9.40 Abstraction variables: 21.59/9.40 21.59/9.40 Exit nodes: 21.59/9.40 21.59/9.40 Accepting locations: 21.59/9.40 21.59/9.40 Asserts: 21.59/9.40 21.59/9.40 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 21.59/9.40 21.59/9.40 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 21.59/9.40 21.59/9.40 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 21.59/9.40 21.59/9.40 Init Location: 0 21.59/9.40 Transitions: 21.59/9.40 0}> 21.59/9.40 ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 varCall_1}> 21.59/9.40 21.59/9.40 = 0)> 21.59/9.40 = 0))> 21.59/9.40 ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 1)}> 21.59/9.40 21.59/9.40 ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 2)}> 21.59/9.40 21.59/9.40 ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 3)}> 21.59/9.40 21.59/9.40 ¿functionCall(__VERIFIER_nondet_int)}> 21.59/9.40 21.59/9.40 21.59/9.40 (main_x + 4)}> 21.59/9.40 21.59/9.40 ~(1)}> 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 21.59/9.40 0}> 21.59/9.40 21.59/9.40 Fresh variables: 21.59/9.40 21.59/9.40 Undef variables: 21.59/9.40 21.59/9.40 Abstraction variables: 21.59/9.40 21.59/9.40 Exit nodes: 21.59/9.40 22, 21.59/9.40 Accepting locations: 21.59/9.40 21.59/9.40 Asserts: 21.59/9.40 21.59/9.40 + + 21.59/9.40 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 21.59/9.40 21.59/9.40 21.59/9.40 Function Return and Parameters Information [2 functions]: 21.59/9.40 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 21.59/9.40 __VERIFIER_nondet_int__func_return_ [function result] : int 21.59/9.40 function name: main [1 return + 0 parameters] demangled: main 21.59/9.40 main__func_return_ [function result] : int 21.59/9.40 21.59/9.40 21.59/9.40 AST Ident Scanner Information [3 idents]: 21.59/9.40 __VERIFIER_nondet_int | function | [integer, ()] | | 21.59/9.40 main | function | [integer, ()] | 21.59/9.40 x | local variable | integer | | 21.59/9.40 21.59/9.40 Main function: main 21.59/9.40 Preprocessed LLVMGraph 21.59/9.40 Init Location: 0 21.59/9.40 Transitions: 21.59/9.40 21.59/9.40 = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 0) /\ (undef10 = 0), par{main_x -> ~(1)}> 21.59/9.40 = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 0) /\ (undef10 = 1), par{main_x -> (main_x + 4)}> 21.59/9.40 = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 1), par{main_x -> (main_x + 3)}> 21.59/9.40 = 0) /\ (undef7 = 0) /\ (undef8 = 1), par{main_x -> (main_x + 2)}> 21.59/9.40 = 0) /\ (undef7 = 1), par{main_x -> (main_x + 1)}> 21.59/9.40 = 0))> 21.59/9.40 21.59/9.40 Fresh variables: 21.59/9.40 undef6, undef7, undef8, undef9, undef10, 21.59/9.40 21.59/9.40 Undef variables: 21.59/9.40 undef6, undef7, undef8, undef9, undef10, 21.59/9.40 21.59/9.40 Abstraction variables: 21.59/9.40 21.59/9.40 Exit nodes: 21.59/9.40 22, 21.59/9.40 Accepting locations: 21.59/9.40 21.59/9.40 Asserts: 21.59/9.40 21.59/9.40 ************************************************************* 21.59/9.40 ******************************************************************************************* 21.59/9.40 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 21.59/9.40 ******************************************************************************************* 21.59/9.40 21.59/9.40 Init Location: 0 21.59/9.40 Graph 0: 21.59/9.40 Transitions: 21.59/9.40 Variables: 21.59/9.40 21.59/9.40 Graph 1: 21.59/9.40 Transitions: 21.59/9.40 -1, rest remain the same}> 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 Variables: 21.59/9.40 main_x 21.59/9.40 21.59/9.40 Graph 2: 21.59/9.40 Transitions: 21.59/9.40 Variables: 21.59/9.40 21.59/9.40 Precedence: 21.59/9.40 Graph 0 21.59/9.40 21.59/9.40 Graph 1 21.59/9.40 21.59/9.40 21.59/9.40 Graph 2 21.59/9.40 21.59/9.40 21.59/9.40 Map Locations to Subgraph: 21.59/9.40 ( 0 , 0 ) 21.59/9.40 ( 2 , 1 ) 21.59/9.40 ( 22 , 2 ) 21.59/9.40 21.59/9.40 ******************************************************************************************* 21.59/9.40 ******************************** CHECKING ASSERTIONS ******************************** 21.59/9.40 ******************************************************************************************* 21.59/9.40 21.59/9.40 Proving termination of subgraph 0 21.59/9.40 Proving termination of subgraph 1 21.59/9.40 Checking unfeasibility... 21.59/9.40 Time used: 0.008806 21.59/9.40 21.59/9.40 Checking conditional termination of SCC {l2}... 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.002391s 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.013510s 21.59/9.40 Piecewise ranking function: min(0,2*main_x) 21.59/9.40 New Graphs: 21.59/9.40 Transitions: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 Variables: 21.59/9.40 main_x 21.59/9.40 Checking conditional termination of SCC {l2}... 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.001503s 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.011283s 21.59/9.40 [2551 : 2553] 21.59/9.40 [2551 : 2554] 21.59/9.40 Successful child: 2553 21.59/9.40 [ Invariant Graph ] 21.59/9.40 Strengthening and disabling transitions... 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 -1, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 [ Termination Graph ] 21.59/9.40 Strengthening and disabling transitions... 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 New Graphs: 21.59/9.40 21.59/9.40 LOG: CALL check - Post:1 + main_x <= 0 - Process 1 21.59/9.40 * Exit transition: 21.59/9.40 * Postcondition : 1 + main_x <= 0 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.000603s 21.59/9.40 > Postcondition is not implied! 21.59/9.40 21.59/9.40 LOG: RETURN check - Elapsed time: 0.000684s 21.59/9.40 INVARIANTS: 21.59/9.40 2: 21.59/9.40 Quasi-INVARIANTS to narrow Graph: 21.59/9.40 2: 1 + main_x <= 0 , 21.59/9.40 It's unfeasible. Removing transition: 21.59/9.40 -1, rest remain the same}> 21.59/9.40 Narrowing transition: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: Narrow transition size 1 21.59/9.40 Narrowing transition: 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: Narrow transition size 1 21.59/9.40 Narrowing transition: 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: Narrow transition size 1 21.59/9.40 Narrowing transition: 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: Narrow transition size 1 21.59/9.40 invGraph after Narrowing: 21.59/9.40 Transitions: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 Variables: 21.59/9.40 main_x 21.59/9.40 Checking conditional termination of SCC {l2}... 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.001596s 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.011600s 21.59/9.40 [2551 : 2558] 21.59/9.40 [2551 : 2559] 21.59/9.40 Solving with 1 template(s). 21.59/9.40 21.59/9.40 LOG: CALL solveNonLinearGetFirstSolution 21.59/9.40 21.59/9.40 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031255s 21.59/9.40 Time used: 0.029943 21.59/9.40 Improving Solution with cost 1 ... 21.59/9.40 21.59/9.40 LOG: CALL solveNonLinearGetNextSolution 21.59/9.40 21.59/9.40 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.117212s 21.59/9.40 Time used: 0.117204 21.59/9.40 21.59/9.40 LOG: SAT solveNonLinear - Elapsed time: 0.148467s 21.59/9.40 Cost: 1; Total time: 0.147147 21.59/9.40 Termination implied by a set of invariant(s): 21.59/9.40 Invariant at l2: 0 <= 1 + main_x 21.59/9.40 [ Invariant Graph ] 21.59/9.40 Strengthening and disabling transitions... 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 [ Termination Graph ] 21.59/9.40 Strengthening and disabling transitions... 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 21.59/9.40 LOG: CALL solverLinear in Graph for feasibility 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear in Graph for feasibility 21.59/9.40 Strengthening transition (result): 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 Quasi-ranking function: 50000 - main_x 21.59/9.40 New Graphs: 21.59/9.40 Transitions: 21.59/9.40 4 + main_x, rest remain the same}> 21.59/9.40 3 + main_x, rest remain the same}> 21.59/9.40 2 + main_x, rest remain the same}> 21.59/9.40 1 + main_x, rest remain the same}> 21.59/9.40 Variables: 21.59/9.40 main_x 21.59/9.40 Checking conditional termination of SCC {l2}... 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.001669s 21.59/9.40 21.59/9.40 LOG: CALL solveLinear 21.59/9.40 21.59/9.40 LOG: RETURN solveLinear - Elapsed time: 0.015752s 21.59/9.40 [2551 : 2563] 21.59/9.40 [2551 : 2564] 21.59/9.40 Solving with 1 template(s). 21.59/9.40 21.59/9.40 LOG: CALL solveNonLinearGetFirstSolution 21.59/9.40 21.59/9.40 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029016s 21.59/9.40 Time used: 0.027532 21.59/9.40 21.59/9.40 [2551 : 2568] 21.59/9.40 [2551 : 2572] 21.59/9.40 Successful child: 2568 21.59/9.40 21.59/9.40 Program does NOT terminate 21.59/9.40 EOF