62.45/28.31 NO 62.45/28.31 62.45/28.31 Solver Timeout: 4 62.45/28.31 Global Timeout: 300 62.45/28.31 Maximum number of concurrent processes: 900 62.45/28.31 ******************************************************************************************* 62.45/28.31 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 62.45/28.31 ******************************************************************************************* 62.45/28.31 62.45/28.31 62.45/28.31 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 62.45/28.31 62.45/28.31 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 62.45/28.31 + + 62.45/28.31 Init Location: 0 62.45/28.31 Transitions: 62.45/28.31 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 62.45/28.31 62.45/28.31 1))> 62.45/28.31 1)> 62.45/28.31 = (2 * main_oldx)))> 62.45/28.31 = (2 * main_oldx))> 62.45/28.31 main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 62.45/28.31 62.45/28.31 0}> 62.45/28.31 62.45/28.31 Fresh variables: 62.45/28.31 62.45/28.31 Undef variables: 62.45/28.31 62.45/28.31 Abstraction variables: 62.45/28.31 62.45/28.31 Exit nodes: 62.45/28.31 62.45/28.31 Accepting locations: 62.45/28.31 62.45/28.31 Asserts: 62.45/28.31 62.45/28.31 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 62.45/28.31 62.45/28.31 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 62.45/28.31 62.45/28.31 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 62.45/28.31 62.45/28.31 Init Location: 0 62.45/28.31 Transitions: 62.45/28.31 0}> 62.45/28.31 ¿functionCall(__VERIFIER_nondet_int)}> 62.45/28.31 varCall_1}> 62.45/28.31 62.45/28.31 1)> 62.45/28.31 1))> 62.45/28.31 = (2 * main_oldx))> 62.45/28.31 = (2 * main_oldx)))> 62.45/28.31 main_x}> 62.45/28.31 ¿functionCall(__VERIFIER_nondet_int)}> 62.45/28.31 varCall_2}> 62.45/28.31 62.45/28.31 0}> 62.45/28.31 62.45/28.31 Fresh variables: 62.45/28.31 62.45/28.31 Undef variables: 62.45/28.31 62.45/28.31 Abstraction variables: 62.45/28.31 62.45/28.31 Exit nodes: 62.45/28.31 7, 62.45/28.31 Accepting locations: 62.45/28.31 62.45/28.31 Asserts: 62.45/28.31 62.45/28.31 + + 62.45/28.31 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 62.45/28.31 62.45/28.31 62.45/28.31 Function Return and Parameters Information [2 functions]: 62.45/28.31 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 62.45/28.31 __VERIFIER_nondet_int__func_return_ [function result] : int 62.45/28.31 function name: main [1 return + 0 parameters] demangled: main 62.45/28.31 main__func_return_ [function result] : int 62.45/28.31 62.45/28.31 62.45/28.31 AST Ident Scanner Information [4 idents]: 62.45/28.31 __VERIFIER_nondet_int | function | [integer, ()] | | 62.45/28.31 main | function | [integer, ()] | 62.45/28.31 x | local variable | integer | | 62.45/28.31 oldx | local variable | integer | | 62.45/28.31 62.45/28.31 Main function: main 62.45/28.31 Preprocessed LLVMGraph 62.45/28.31 Init Location: 0 62.45/28.31 Transitions: 62.45/28.31 62.45/28.31 1) /\ (main_x >= (2 * main_oldx)), par{main_x -> undef4, main_oldx -> main_x}> 62.45/28.31 1) /\ not((main_x >= (2 * main_oldx)))> 62.45/28.31 1))> 62.45/28.31 62.45/28.31 Fresh variables: 62.45/28.31 undef3, undef4, 62.45/28.31 62.45/28.31 Undef variables: 62.45/28.31 undef3, undef4, 62.45/28.31 62.45/28.31 Abstraction variables: 62.45/28.31 62.45/28.31 Exit nodes: 62.45/28.31 7, 62.45/28.31 Accepting locations: 62.45/28.31 62.45/28.31 Asserts: 62.45/28.31 62.45/28.31 ************************************************************* 62.45/28.31 ******************************************************************************************* 62.45/28.31 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 62.45/28.31 ******************************************************************************************* 62.45/28.31 62.45/28.31 Init Location: 0 62.45/28.31 Graph 0: 62.45/28.31 Transitions: 62.45/28.31 Variables: 62.45/28.31 62.45/28.31 Graph 1: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 62.45/28.31 Graph 2: 62.45/28.31 Transitions: 62.45/28.31 Variables: 62.45/28.31 62.45/28.31 Precedence: 62.45/28.31 Graph 0 62.45/28.31 62.45/28.31 Graph 1 62.45/28.31 62.45/28.31 62.45/28.31 Graph 2 62.45/28.31 62.45/28.31 62.45/28.31 62.45/28.31 Map Locations to Subgraph: 62.45/28.31 ( 0 , 0 ) 62.45/28.31 ( 2 , 1 ) 62.45/28.31 ( 7 , 2 ) 62.45/28.31 62.45/28.31 ******************************************************************************************* 62.45/28.31 ******************************** CHECKING ASSERTIONS ******************************** 62.45/28.31 ******************************************************************************************* 62.45/28.31 62.45/28.31 Proving termination of subgraph 0 62.45/28.31 Proving termination of subgraph 1 62.45/28.31 Checking unfeasibility... 62.45/28.31 Time used: 0.001839 62.45/28.31 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000681s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002092s 62.45/28.31 [63719 : 63721] 62.45/28.31 [63719 : 63722] 62.45/28.31 Successful child: 63721 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 62.45/28.31 LOG: CALL check - Post:1 + main_x <= 0 - Process 1 62.45/28.31 * Exit transition: 62.45/28.31 * Postcondition : 1 + main_x <= 0 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000367s 62.45/28.31 > Postcondition is not implied! 62.45/28.31 62.45/28.31 LOG: RETURN check - Elapsed time: 0.000445s 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: 1 + main_x <= 0 , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 1 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000673s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002227s 62.45/28.31 [63719 : 63726] 62.45/28.31 [63719 : 63727] 62.45/28.31 Successful child: 63726 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 62.45/28.31 LOG: CALL check - Post:main_x <= main_oldx - Process 2 62.45/28.31 * Exit transition: 62.45/28.31 * Postcondition : main_x <= main_oldx 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000492s 62.45/28.31 > Postcondition is not implied! 62.45/28.31 62.45/28.31 LOG: RETURN check - Elapsed time: 0.000585s 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= main_oldx , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 1 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000677s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002520s 62.45/28.31 [63719 : 63731] 62.45/28.31 [63719 : 63732] 62.45/28.31 Successful child: 63731 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 62.45/28.31 LOG: CALL check - Post:main_x <= 0 - Process 3 62.45/28.31 * Exit transition: 62.45/28.31 * Postcondition : main_x <= 0 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000561s 62.45/28.31 > Postcondition is not implied! 62.45/28.31 62.45/28.31 LOG: RETURN check - Elapsed time: 0.000656s 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= 0 , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 1 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000694s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002534s 62.45/28.31 [63719 : 63736] 62.45/28.31 [63719 : 63737] 62.45/28.31 Successful child: 63736 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 62.45/28.31 LOG: CALL check - Post:main_x <= 1 - Process 4 62.45/28.31 * Exit transition: 62.45/28.31 * Postcondition : main_x <= 1 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000593s 62.45/28.31 > Postcondition is not implied! 62.45/28.31 62.45/28.31 LOG: RETURN check - Elapsed time: 0.000690s 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= 1 , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 1 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000679s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002541s 62.45/28.31 [63719 : 63741] 62.45/28.31 [63719 : 63742] 62.45/28.31 Successful child: 63741 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 [63719 : 63746] 62.45/28.31 [63719 : 63747] 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: 2 <= main_oldx , main_x <= 1 + main_oldx , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.001685s 62.45/28.31 Ranking function: 2 - 2*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000721s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.003050s 62.45/28.31 [63719 : 63748] 62.45/28.31 [63719 : 63749] 62.45/28.31 Successful child: 63748 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 [63719 : 63753] 62.45/28.31 [63719 : 63754] 62.45/28.31 [63719 : 63755] 62.45/28.31 [63719 : 63756] 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= 2 + main_oldx , 3 <= main_oldx , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.003024s 62.45/28.31 Ranking function: 1 + (~(1) / 2)*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000726s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002855s 62.45/28.31 [63719 : 63757] 62.45/28.31 [63719 : 63758] 62.45/28.31 Successful child: 63757 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 [63719 : 63762] 62.45/28.31 [63719 : 63763] 62.45/28.31 [63719 : 63764] 62.45/28.31 [63719 : 63765] 62.45/28.31 [63719 : 63766] 62.45/28.31 [63719 : 63767] 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= 3 + main_oldx , 4 <= main_oldx , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.004254s 62.45/28.31 Ranking function: 30 - 15*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.001763s 62.45/28.31 Ranking function: 63 - 21*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000736s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002908s 62.45/28.31 [63719 : 63768] 62.45/28.31 [63719 : 63769] 62.45/28.31 Successful child: 63768 62.45/28.31 [ Invariant Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: CALL solverLinear in Graph for feasibility 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear in Graph for feasibility 62.45/28.31 It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 [ Termination Graph ] 62.45/28.31 Strengthening and disabling transitions... 62.45/28.31 > It's unfeasible. Removing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 New Graphs: 62.45/28.31 [63719 : 63773] 62.45/28.31 [63719 : 63774] 62.45/28.31 [63719 : 63775] 62.45/28.31 [63719 : 63776] 62.45/28.31 [63719 : 63777] 62.45/28.31 [63719 : 63778] 62.45/28.31 INVARIANTS: 62.45/28.31 2: 62.45/28.31 Quasi-INVARIANTS to narrow Graph: 62.45/28.31 2: main_x <= 4 + main_oldx , 5 <= main_oldx , 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 Narrowing transition: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 62.45/28.31 LOG: Narrow transition size 2 62.45/28.31 invGraph after Narrowing: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.005847s 62.45/28.31 Ranking function: 30 - 15*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.002474s 62.45/28.31 Ranking function: 63 - 21*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.001850s 62.45/28.31 Ranking function: 108 - 27*main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000743s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.003076s 62.45/28.31 [63719 : 63779] 62.45/28.31 [63719 : 63780] 62.45/28.31 Solving with 1 template(s). 62.45/28.31 62.45/28.31 LOG: CALL solveNonLinearGetFirstSolution 62.45/28.31 62.45/28.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034622s 62.45/28.31 Time used: 0.03387 62.45/28.31 Improving Solution with cost 1 ... 62.45/28.31 62.45/28.31 LOG: CALL solveNonLinearGetNextSolution 62.45/28.31 62.45/28.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089802s 62.45/28.31 Time used: 0.089778 62.45/28.31 62.45/28.31 LOG: SAT solveNonLinear - Elapsed time: 0.124424s 62.45/28.31 Cost: 1; Total time: 0.123648 62.45/28.31 Quasi-ranking function: 50000 - main_oldx 62.45/28.31 New Graphs: 62.45/28.31 Transitions: 62.45/28.31 undef4, main_oldx -> main_x, rest remain the same}> 62.45/28.31 Variables: 62.45/28.31 main_x, main_oldx 62.45/28.31 Checking conditional termination of SCC {l2}... 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.000839s 62.45/28.31 62.45/28.31 LOG: CALL solveLinear 62.45/28.31 62.45/28.31 LOG: RETURN solveLinear - Elapsed time: 0.003536s 62.45/28.31 [63719 : 63784] 62.45/28.31 [63719 : 63785] 62.45/28.31 Solving with 1 template(s). 62.45/28.31 62.45/28.31 LOG: CALL solveNonLinearGetFirstSolution 62.45/28.31 62.45/28.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023867s 62.45/28.31 Time used: 0.023313 62.45/28.31 62.45/28.31 [63719 : 63789] 62.45/28.31 [63719 : 63793] 62.45/28.31 Successful child: 63789 62.45/28.31 62.45/28.31 Program does NOT terminate 62.45/28.31 EOF