24.82/10.11 NO 24.82/10.11 24.82/10.11 Solver Timeout: 4 24.82/10.11 Global Timeout: 300 24.82/10.11 Maximum number of concurrent processes: 900 24.82/10.11 ******************************************************************************************* 24.82/10.11 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 24.82/10.11 ******************************************************************************************* 24.82/10.11 24.82/10.11 24.82/10.11 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 24.82/10.11 24.82/10.11 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 24.82/10.11 + + 24.82/10.11 Init Location: 0 24.82/10.11 Transitions: 24.82/10.11 0, main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> 24.82/10.11 24.82/10.11 = 7))> 24.82/10.11 = 7)> 24.82/10.11 main_a, main_a -> main_b, main_b -> (main_olda + 1)}> 24.82/10.11 24.82/10.11 0}> 24.82/10.11 24.82/10.11 Fresh variables: 24.82/10.11 24.82/10.11 Undef variables: 24.82/10.11 24.82/10.11 Abstraction variables: 24.82/10.11 24.82/10.11 Exit nodes: 24.82/10.11 24.82/10.11 Accepting locations: 24.82/10.11 24.82/10.11 Asserts: 24.82/10.11 24.82/10.11 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 24.82/10.11 24.82/10.11 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 24.82/10.11 24.82/10.11 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 24.82/10.11 24.82/10.11 Init Location: 0 24.82/10.11 Transitions: 24.82/10.11 0}> 24.82/10.11 ¿functionCall(__VERIFIER_nondet_int)}> 24.82/10.11 varCall_1}> 24.82/10.11 ¿functionCall(__VERIFIER_nondet_int)}> 24.82/10.11 varCall_2}> 24.82/10.11 24.82/10.11 = 7)> 24.82/10.11 = 7))> 24.82/10.11 main_a, main_a -> main_b, main_b -> (main_olda + 1)}> 24.82/10.11 24.82/10.11 0}> 24.82/10.11 24.82/10.11 Fresh variables: 24.82/10.11 24.82/10.11 Undef variables: 24.82/10.11 24.82/10.11 Abstraction variables: 24.82/10.11 24.82/10.11 Exit nodes: 24.82/10.11 6, 24.82/10.11 Accepting locations: 24.82/10.11 24.82/10.11 Asserts: 24.82/10.11 24.82/10.11 + + 24.82/10.11 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 24.82/10.11 24.82/10.11 24.82/10.11 Function Return and Parameters Information [2 functions]: 24.82/10.11 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 24.82/10.11 __VERIFIER_nondet_int__func_return_ [function result] : int 24.82/10.11 function name: main [1 return + 0 parameters] demangled: main 24.82/10.11 main__func_return_ [function result] : int 24.82/10.11 24.82/10.11 24.82/10.11 AST Ident Scanner Information [5 idents]: 24.82/10.11 __VERIFIER_nondet_int | function | [integer, ()] | | 24.82/10.11 main | function | [integer, ()] | 24.82/10.11 a | local variable | integer | | 24.82/10.11 b | local variable | integer | | 24.82/10.11 olda | local variable | integer | | 24.82/10.11 24.82/10.11 Main function: main 24.82/10.11 Preprocessed LLVMGraph 24.82/10.11 Init Location: 0 24.82/10.11 Transitions: 24.82/10.11 24.82/10.11 = 7), par{main_a -> main_b, main_b -> (main_a + 1)}> 24.82/10.11 = 7))> 24.82/10.11 24.82/10.11 Fresh variables: 24.82/10.11 undef3, undef4, 24.82/10.11 24.82/10.11 Undef variables: 24.82/10.11 undef3, undef4, 24.82/10.11 24.82/10.11 Abstraction variables: 24.82/10.11 24.82/10.11 Exit nodes: 24.82/10.11 6, 24.82/10.11 Accepting locations: 24.82/10.11 24.82/10.11 Asserts: 24.82/10.11 24.82/10.11 ************************************************************* 24.82/10.11 ******************************************************************************************* 24.82/10.11 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 24.82/10.11 ******************************************************************************************* 24.82/10.11 24.82/10.11 Init Location: 0 24.82/10.11 Graph 0: 24.82/10.11 Transitions: 24.82/10.11 Variables: 24.82/10.11 24.82/10.11 Graph 1: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 24.82/10.11 Graph 2: 24.82/10.11 Transitions: 24.82/10.11 Variables: 24.82/10.11 24.82/10.11 Precedence: 24.82/10.11 Graph 0 24.82/10.11 24.82/10.11 Graph 1 24.82/10.11 24.82/10.11 24.82/10.11 Graph 2 24.82/10.11 24.82/10.11 24.82/10.11 Map Locations to Subgraph: 24.82/10.11 ( 0 , 0 ) 24.82/10.11 ( 2 , 1 ) 24.82/10.11 ( 6 , 2 ) 24.82/10.11 24.82/10.11 ******************************************************************************************* 24.82/10.11 ******************************** CHECKING ASSERTIONS ******************************** 24.82/10.11 ******************************************************************************************* 24.82/10.11 24.82/10.11 Proving termination of subgraph 0 24.82/10.11 Proving termination of subgraph 1 24.82/10.11 Checking unfeasibility... 24.82/10.11 Time used: 0.002002 24.82/10.11 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000530s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.001537s 24.82/10.11 [50750 : 50752] 24.82/10.11 [50750 : 50753] 24.82/10.11 Successful child: 50752 24.82/10.11 [ Invariant Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 [ Termination Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 New Graphs: 24.82/10.11 24.82/10.11 LOG: CALL check - Post:main_a <= 2 - Process 1 24.82/10.11 * Exit transition: 24.82/10.11 * Postcondition : main_a <= 2 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000475s 24.82/10.11 > Postcondition is not implied! 24.82/10.11 24.82/10.11 LOG: RETURN check - Elapsed time: 0.000570s 24.82/10.11 INVARIANTS: 24.82/10.11 2: 24.82/10.11 Quasi-INVARIANTS to narrow Graph: 24.82/10.11 2: main_a <= 2 , 24.82/10.11 Narrowing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 24.82/10.11 LOG: Narrow transition size 1 24.82/10.11 invGraph after Narrowing: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000507s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.001661s 24.82/10.11 [50750 : 50757] 24.82/10.11 [50750 : 50758] 24.82/10.11 Successful child: 50757 24.82/10.11 [ Invariant Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 [ Termination Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 > It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 New Graphs: 24.82/10.11 24.82/10.11 LOG: CALL check - Post:main_a <= 3 - Process 2 24.82/10.11 * Exit transition: 24.82/10.11 * Postcondition : main_a <= 3 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000559s 24.82/10.11 > Postcondition is not implied! 24.82/10.11 24.82/10.11 LOG: RETURN check - Elapsed time: 0.000658s 24.82/10.11 INVARIANTS: 24.82/10.11 2: 24.82/10.11 Quasi-INVARIANTS to narrow Graph: 24.82/10.11 2: main_a <= 3 , 24.82/10.11 Narrowing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 24.82/10.11 LOG: Narrow transition size 1 24.82/10.11 invGraph after Narrowing: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000506s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.001626s 24.82/10.11 [50750 : 50762] 24.82/10.11 [50750 : 50763] 24.82/10.11 Successful child: 50762 24.82/10.11 [ Invariant Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 [ Termination Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 New Graphs: 24.82/10.11 24.82/10.11 LOG: CALL check - Post:main_a <= 5 - Process 3 24.82/10.11 * Exit transition: 24.82/10.11 * Postcondition : main_a <= 5 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000564s 24.82/10.11 > Postcondition is not implied! 24.82/10.11 24.82/10.11 LOG: RETURN check - Elapsed time: 0.000661s 24.82/10.11 INVARIANTS: 24.82/10.11 2: 24.82/10.11 Quasi-INVARIANTS to narrow Graph: 24.82/10.11 2: main_a <= 5 , 24.82/10.11 Narrowing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 24.82/10.11 LOG: Narrow transition size 1 24.82/10.11 invGraph after Narrowing: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000505s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.001642s 24.82/10.11 [50750 : 50767] 24.82/10.11 [50750 : 50768] 24.82/10.11 Successful child: 50767 24.82/10.11 [ Invariant Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 24.82/10.11 LOG: CALL solverLinear in Graph for feasibility 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear in Graph for feasibility 24.82/10.11 It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 [ Termination Graph ] 24.82/10.11 Strengthening and disabling transitions... 24.82/10.11 > It's unfeasible. Removing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 New Graphs: 24.82/10.11 24.82/10.11 LOG: CALL check - Post:main_a <= 6 - Process 4 24.82/10.11 * Exit transition: 24.82/10.11 * Postcondition : main_a <= 6 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000592s 24.82/10.11 > Postcondition is not implied! 24.82/10.11 24.82/10.11 LOG: RETURN check - Elapsed time: 0.000686s 24.82/10.11 INVARIANTS: 24.82/10.11 2: 24.82/10.11 Quasi-INVARIANTS to narrow Graph: 24.82/10.11 2: main_a <= 6 , 24.82/10.11 Narrowing transition: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 24.82/10.11 LOG: Narrow transition size 1 24.82/10.11 invGraph after Narrowing: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000501s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.001661s 24.82/10.11 [50750 : 50772] 24.82/10.11 [50750 : 50773] 24.82/10.11 Solving with 1 template(s). 24.82/10.11 24.82/10.11 LOG: CALL solveNonLinearGetFirstSolution 24.82/10.11 24.82/10.11 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006675s 24.82/10.11 Time used: 0.00634 24.82/10.11 Improving Solution with cost 1 ... 24.82/10.11 24.82/10.11 LOG: CALL solveNonLinearGetNextSolution 24.82/10.11 24.82/10.11 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012633s 24.82/10.11 Time used: 0.012626 24.82/10.11 24.82/10.11 LOG: SAT solveNonLinear - Elapsed time: 0.019308s 24.82/10.11 Cost: 1; Total time: 0.018966 24.82/10.11 Quasi-ranking function: 50000 - main_a - main_b 24.82/10.11 New Graphs: 24.82/10.11 Transitions: 24.82/10.11 main_b, main_b -> 1 + main_a, rest remain the same}> 24.82/10.11 Variables: 24.82/10.11 main_a, main_b 24.82/10.11 Checking conditional termination of SCC {l2}... 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.000585s 24.82/10.11 24.82/10.11 LOG: CALL solveLinear 24.82/10.11 24.82/10.11 LOG: RETURN solveLinear - Elapsed time: 0.002143s 24.82/10.11 [50750 : 50777] 24.82/10.11 [50750 : 50778] 24.82/10.11 Solving with 1 template(s). 24.82/10.11 24.82/10.11 LOG: CALL solveNonLinearGetFirstSolution 24.82/10.11 24.82/10.11 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007811s 24.82/10.11 Time used: 0.007442 24.82/10.11 24.82/10.11 [50750 : 50782] 24.82/10.11 [50750 : 50786] 24.82/10.11 Successful child: 50782 24.82/10.11 24.82/10.11 Program does NOT terminate 24.82/10.11 EOF