24.90/9.00 YES 24.90/9.00 24.90/9.00 Solver Timeout: 4 24.90/9.00 Global Timeout: 300 24.90/9.00 Maximum number of concurrent processes: 900 24.90/9.00 ******************************************************************************************* 24.90/9.00 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 24.90/9.00 ******************************************************************************************* 24.90/9.00 24.90/9.00 24.90/9.00 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 24.90/9.00 24.90/9.00 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 24.90/9.00 + + 24.90/9.00 Init Location: 0 24.90/9.00 Transitions: 24.90/9.00 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 24.90/9.00 24.90/9.00 = 0))> 24.90/9.00 = 0)> 24.90/9.00 24.90/9.00 24.90/9.00 (main_x + main_y)}> 24.90/9.00 24.90/9.00 (main_x + main_z)}> 24.90/9.00 24.90/9.00 (main_y + main_z), main_z -> (main_z - 1)}> 24.90/9.00 24.90/9.00 0}> 24.90/9.00 24.90/9.00 Fresh variables: 24.90/9.00 24.90/9.00 Undef variables: 24.90/9.00 24.90/9.00 Abstraction variables: 24.90/9.00 24.90/9.00 Exit nodes: 24.90/9.00 24.90/9.00 Accepting locations: 24.90/9.00 24.90/9.00 Asserts: 24.90/9.00 24.90/9.00 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 24.90/9.00 24.90/9.00 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 24.90/9.00 24.90/9.00 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 24.90/9.00 24.90/9.00 Init Location: 0 24.90/9.00 Transitions: 24.90/9.00 0}> 24.90/9.00 ¿functionCall(__VERIFIER_nondet_int)}> 24.90/9.00 varCall_1}> 24.90/9.00 ¿functionCall(__VERIFIER_nondet_int)}> 24.90/9.00 varCall_2}> 24.90/9.00 ¿functionCall(__VERIFIER_nondet_int)}> 24.90/9.00 varCall_3}> 24.90/9.00 24.90/9.00 = 0)> 24.90/9.00 = 0))> 24.90/9.00 ¿functionCall(__VERIFIER_nondet_int)}> 24.90/9.00 24.90/9.00 24.90/9.00 (main_x + main_y)}> 24.90/9.00 24.90/9.00 (main_x + main_z)}> 24.90/9.00 24.90/9.00 (main_y + main_z), main_z -> (main_z - 1)}> 24.90/9.00 24.90/9.00 0}> 24.90/9.00 24.90/9.00 Fresh variables: 24.90/9.00 24.90/9.00 Undef variables: 24.90/9.00 24.90/9.00 Abstraction variables: 24.90/9.00 24.90/9.00 Exit nodes: 24.90/9.00 11, 24.90/9.00 Accepting locations: 24.90/9.00 24.90/9.00 Asserts: 24.90/9.00 24.90/9.00 + + 24.90/9.00 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 24.90/9.00 24.90/9.00 24.90/9.00 Function Return and Parameters Information [2 functions]: 24.90/9.00 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 24.90/9.00 __VERIFIER_nondet_int__func_return_ [function result] : int 24.90/9.00 function name: main [1 return + 0 parameters] demangled: main 24.90/9.00 main__func_return_ [function result] : int 24.90/9.00 24.90/9.00 24.90/9.00 AST Ident Scanner Information [5 idents]: 24.90/9.00 __VERIFIER_nondet_int | function | [integer, ()] | | 24.90/9.00 main | function | [integer, ()] | 24.90/9.00 x | local variable | integer | | 24.90/9.00 y | local variable | integer | | 24.90/9.00 z | local variable | integer | | 24.90/9.00 24.90/9.00 Main function: main 24.90/9.00 Preprocessed LLVMGraph 24.90/9.00 Init Location: 0 24.90/9.00 Transitions: 24.90/9.00 24.90/9.00 = 0) /\ (undef8 = 0), par{main_x -> (main_x + main_z), main_y -> (main_y + main_z), main_z -> (main_z - 1)}> 24.90/9.00 = 0) /\ (undef8 = 1), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}> 24.90/9.00 = 0))> 24.90/9.00 24.90/9.00 Fresh variables: 24.90/9.00 undef5, undef6, undef7, undef8, 24.90/9.00 24.90/9.00 Undef variables: 24.90/9.00 undef5, undef6, undef7, undef8, 24.90/9.00 24.90/9.00 Abstraction variables: 24.90/9.00 24.90/9.00 Exit nodes: 24.90/9.00 11, 24.90/9.00 Accepting locations: 24.90/9.00 24.90/9.00 Asserts: 24.90/9.00 24.90/9.00 ************************************************************* 24.90/9.00 ******************************************************************************************* 24.90/9.00 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 24.90/9.00 ******************************************************************************************* 24.90/9.00 24.90/9.00 Init Location: 0 24.90/9.00 Graph 0: 24.90/9.00 Transitions: 24.90/9.00 Variables: 24.90/9.00 24.90/9.00 Graph 1: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 24.90/9.00 Graph 2: 24.90/9.00 Transitions: 24.90/9.00 Variables: 24.90/9.00 24.90/9.00 Precedence: 24.90/9.00 Graph 0 24.90/9.00 24.90/9.00 Graph 1 24.90/9.00 24.90/9.00 24.90/9.00 Graph 2 24.90/9.00 24.90/9.00 24.90/9.00 Map Locations to Subgraph: 24.90/9.00 ( 0 , 0 ) 24.90/9.00 ( 2 , 1 ) 24.90/9.00 ( 11 , 2 ) 24.90/9.00 24.90/9.00 ******************************************************************************************* 24.90/9.00 ******************************** CHECKING ASSERTIONS ******************************** 24.90/9.00 ******************************************************************************************* 24.90/9.00 24.90/9.00 Proving termination of subgraph 0 24.90/9.00 Proving termination of subgraph 1 24.90/9.00 Checking unfeasibility... 24.90/9.00 Time used: 0.004529 24.90/9.00 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.001193s 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.003226s 24.90/9.00 [47480 : 47482] 24.90/9.00 [47480 : 47483] 24.90/9.00 Successful child: 47482 24.90/9.00 [ Invariant Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 [ Termination Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 > It's unfeasible. Removing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 New Graphs: 24.90/9.00 24.90/9.00 LOG: CALL check - Post:1 + main_x <= 0 - Process 1 24.90/9.00 * Exit transition: 24.90/9.00 * Postcondition : 1 + main_x <= 0 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.000584s 24.90/9.00 > Postcondition is not implied! 24.90/9.00 24.90/9.00 LOG: RETURN check - Elapsed time: 0.000686s 24.90/9.00 INVARIANTS: 24.90/9.00 2: 24.90/9.00 Quasi-INVARIANTS to narrow Graph: 24.90/9.00 2: 1 + main_x <= 0 , 24.90/9.00 Narrowing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: Narrow transition size 1 24.90/9.00 Narrowing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: Narrow transition size 1 24.90/9.00 invGraph after Narrowing: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.001104s 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.003498s 24.90/9.00 [47480 : 47487] 24.90/9.00 [47480 : 47488] 24.90/9.00 Successful child: 47487 24.90/9.00 [ Invariant Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 [ Termination Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Ranking function: main_x 24.90/9.00 New Graphs: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.000726s 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.002751s 24.90/9.00 [47480 : 47492] 24.90/9.00 [47480 : 47493] 24.90/9.00 Successful child: 47492 24.90/9.00 [ Invariant Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 [ Termination Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Ranking function: main_x 24.90/9.00 New Graphs: 24.90/9.00 [47480 : 47497] 24.90/9.00 [47480 : 47498] 24.90/9.00 INVARIANTS: 24.90/9.00 2: 24.90/9.00 Quasi-INVARIANTS to narrow Graph: 24.90/9.00 2: main_x + main_z <= 0 , 1 + main_x + main_y <= 0 , 24.90/9.00 24.90/9.00 LOG: CALL check - Post:1 + main_z <= 0 - Process 2 24.90/9.00 * Exit transition: 24.90/9.00 * Postcondition : 1 + main_z <= 0 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.000908s 24.90/9.00 > Postcondition is not implied! 24.90/9.00 24.90/9.00 LOG: RETURN check - Elapsed time: 0.001023s 24.90/9.00 INVARIANTS: 24.90/9.00 2: 24.90/9.00 Quasi-INVARIANTS to narrow Graph: 24.90/9.00 2: 1 + main_z <= 0 , 24.90/9.00 Narrowing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: Narrow transition size 3 24.90/9.00 Narrowing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: Narrow transition size 3 24.90/9.00 invGraph after Narrowing: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.004454s 24.90/9.00 Ranking function: main_z 24.90/9.00 New Graphs: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.002161s 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.021923s 24.90/9.00 [47480 : 47499] 24.90/9.00 [47480 : 47500] 24.90/9.00 Successful child: 47499 24.90/9.00 [ Invariant Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 [ Termination Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 > It's unfeasible. Removing transition: 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 New Graphs: 24.90/9.00 Transitions: 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 Variables: 24.90/9.00 main_x, main_y, main_z 24.90/9.00 Checking conditional termination of SCC {l2}... 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.001353s 24.90/9.00 24.90/9.00 LOG: CALL solveLinear 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear - Elapsed time: 0.006078s 24.90/9.00 [47480 : 47504] 24.90/9.00 [47480 : 47505] 24.90/9.00 Successful child: 47504 24.90/9.00 [ Invariant Graph ] 24.90/9.00 Strengthening and disabling transitions... 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 Strengthening transition (result): 24.90/9.00 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.00 24.90/9.00 LOG: CALL solverLinear in Graph for feasibility 24.90/9.00 24.90/9.00 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.00 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 New Graphs: 24.90/9.01 [47480 : 47509] 24.90/9.01 [47480 : 47510] 24.90/9.01 [47480 : 47511] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: main_x + main_y <= 0 , main_x + main_z <= 0 , 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: 1 + main_x + main_y <= 0 , 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 invGraph after Narrowing: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.006142s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.242916s 24.90/9.01 [47480 : 47512] 24.90/9.01 [47480 : 47513] 24.90/9.01 Successful child: 47512 24.90/9.01 [ Invariant Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Ranking function: 3 + 2*main_y - 3*main_z 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.003467s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.043882s 24.90/9.01 Piecewise ranking function: min(3 + 2*main_x + 2*main_z,0) 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.002362s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.081288s 24.90/9.01 [47480 : 47517] 24.90/9.01 [47480 : 47518] 24.90/9.01 Successful child: 47518 24.90/9.01 Ranking function: 2*main_x - 2*main_z 24.90/9.01 Ranking function and negation of Quasi-Invariant applied 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.001876s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.026141s 24.90/9.01 [47480 : 47522] 24.90/9.01 [47480 : 47523] 24.90/9.01 Successful child: 47522 24.90/9.01 [ Invariant Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Ranking function: main_x + main_y 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.001050s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.004669s 24.90/9.01 [47480 : 47527] 24.90/9.01 [47480 : 47528] 24.90/9.01 Successful child: 47527 24.90/9.01 [ Invariant Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 > It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 New Graphs: 24.90/9.01 [47480 : 47532] 24.90/9.01 [47480 : 47533] 24.90/9.01 [47480 : 47534] 24.90/9.01 [47480 : 47535] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: 2 + main_z <= 0 , 24.90/9.01 [47480 : 47536] 24.90/9.01 [47480 : 47537] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: main_y <= 2 , 24.90/9.01 [47480 : 47538] 24.90/9.01 [47480 : 47539] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: main_x + main_y <= 0 , 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 3 24.90/9.01 invGraph after Narrowing: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.008437s 24.90/9.01 Ranking function: 1 + main_z 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.002630s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.041550s 24.90/9.01 [47480 : 47540] 24.90/9.01 [47480 : 47541] 24.90/9.01 Successful child: 47540 24.90/9.01 [ Invariant Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Ranking function: 2 + 2*main_x + main_y + main_z 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.002854s 24.90/9.01 Ranking function: (~(1) / 2) + (1 / 2)*main_x + (1 / 2)*main_y 24.90/9.01 New Graphs: 24.90/9.01 [47480 : 47545] 24.90/9.01 [47480 : 47546] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: main_y <= 0 , main_z <= 0 , 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 2 24.90/9.01 invGraph after Narrowing: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.009316s 24.90/9.01 Ranking function: -3 + 3*main_z 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.003003s 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.035184s 24.90/9.01 [47480 : 47547] 24.90/9.01 [47480 : 47548] 24.90/9.01 Successful child: 47547 24.90/9.01 [ Invariant Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 [ Termination Graph ] 24.90/9.01 Strengthening and disabling transitions... 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: CALL solverLinear in Graph for feasibility 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear in Graph for feasibility 24.90/9.01 Strengthening transition (result): 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Ranking function: 2 - main_x + 2*main_y - main_z 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.003925s 24.90/9.01 Ranking function: -1 + main_y 24.90/9.01 New Graphs: 24.90/9.01 [47480 : 47552] 24.90/9.01 [47480 : 47553] 24.90/9.01 [47480 : 47554] 24.90/9.01 [47480 : 47555] 24.90/9.01 INVARIANTS: 24.90/9.01 2: 24.90/9.01 Quasi-INVARIANTS to narrow Graph: 24.90/9.01 2: 1 + main_z <= 0 , 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 It's unfeasible. Removing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 Narrowing transition: 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 24.90/9.01 LOG: Narrow transition size 1 24.90/9.01 invGraph after Narrowing: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.007763s 24.90/9.01 Ranking function: -3*main_y 24.90/9.01 New Graphs: 24.90/9.01 Transitions: 24.90/9.01 main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> 24.90/9.01 Variables: 24.90/9.01 main_x, main_y, main_z 24.90/9.01 Checking conditional termination of SCC {l2}... 24.90/9.01 24.90/9.01 LOG: CALL solveLinear 24.90/9.01 24.90/9.01 LOG: RETURN solveLinear - Elapsed time: 0.002991s 24.90/9.01 Ranking function: main_z 24.90/9.01 New Graphs: 24.90/9.01 Proving termination of subgraph 2 24.90/9.01 Analyzing SCC {l11}... 24.90/9.01 No cycles found. 24.90/9.01 24.90/9.01 Program Terminates 24.90/9.01 EOF