NO Solver Timeout: 4 Global Timeout: 60 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> main_y, main_xtmp -> main_x}> 0}> 0}> main_y))> main_y)> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> main_y, main_xtmp -> main_x}> 0}> 0}> main_y)> main_y))> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 20, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | tmp | local variable | integer | | xtmp | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ (main_x <= 0), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x = main_y), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x < main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x > main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> main_y), par{main_xtmp -> (main_xtmp - main_y)}> main_y)), par{main_x -> main_tmp, main_y -> main_xtmp}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 20, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 12 , 1 ) ( 20 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.038859 Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005471s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.045081s [36976 : 36980] [36976 : 36981] Successful child: 36980 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: -main_y + main_xtmp, rest remain the same}> Variables: main_y, main_tmp, main_xtmp Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000658s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002187s [36976 : 37008] [36976 : 37009] Successful child: 37008 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001925s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039514s [36976 : 37014] [36976 : 37015] Successful child: 37014 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001483s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011864s [36976 : 37024] [36976 : 37025] Successful child: 37024 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x + main_y <= 1 - Process 1 * Exit transition: * Postcondition : main_x + main_y <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001491s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001597s INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: main_y + main_tmp <= 0 , INVARIANTS: 12: 1 <= main_y + main_tmp , Quasi-INVARIANTS to narrow Graph: 12: LOG: CALL check - Post:0 <= main_x + main_y - Process 2 * Exit transition: * Postcondition : 0 <= main_x + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001166s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001256s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , [36976 : 37036] [36976 : 37037] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , main_y <= main_x , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004856s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.098163s [36976 : 37038] [36976 : 37039] Successful child: 37038 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002531s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.086978s [36976 : 37078] [36976 : 37079] Successful child: 37078 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001781s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017211s [36976 : 37094] [36976 : 37095] Successful child: 37094 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Ranking function: 22 - 23*main_x - 22*main_y New Graphs: [36976 : 37130] [36976 : 37131] INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: 1 <= 0 , [36976 : 37132] [36976 : 37133] [36976 : 37134] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , [36976 : 37135] [36976 : 37136] [36976 : 37137] [36976 : 37138] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , main_x <= 1 + main_y , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009911s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.251336s [36976 : 37139] [36976 : 37140] Successful child: 37139 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003903s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.173626s [36976 : 37144] [36976 : 37145] Successful child: 37144 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002905s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.078729s [36976 : 37149] [36976 : 37150] Successful child: 37149 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002227s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025188s [36976 : 37154] [36976 : 37155] Successful child: 37154 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002917s Ranking function: main_x New Graphs: [36976 : 37159] [36976 : 37160] [36976 : 37161] INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: main_y + main_tmp <= 0 , [36976 : 37162] [36976 : 37163] [36976 : 37164] [36976 : 37165] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_x + main_y , LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 3 * Exit transition: * Postcondition : 1 + main_x + main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003202s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003361s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x + main_y <= 0 , [36976 : 37166] [36976 : 37167] [36976 : 37168] [36976 : 37169] [36976 : 37170] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , 0 <= 1 + main_x , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011907s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.319938s [36976 : 37171] [36976 : 37172] Successful child: 37171 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005529s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.379182s [36976 : 37176] [36976 : 37177] Successful child: 37176 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004465s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.136022s [36976 : 37181] [36976 : 37182] Successful child: 37181 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003443s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044734s [36976 : 37186] [36976 : 37187] Successful child: 37186 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002150s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013106s [36976 : 37191] [36976 : 37192] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025152s Time used: 0.024284 [36976 : 37196] [36976 : 37200] Successful child: 37200 Program does NOT terminate