/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 1, e^0 -> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 1, e^0 -> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}> 0, e^0 -> 1, n^0 -> undef78}> Fresh variables: undef78, Undef variables: undef78, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 1, e^0 -> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 1, e^0 -> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}> Fresh variables: undef78, Undef variables: undef78, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.022527 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004460s Ranking function: -copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001461s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006705s [57991 : 57992] [57991 : 57993] Successful child: 57992 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2*e^0 New Graphs: [57991 : 58056] [57991 : 58057] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_100^0 <= n^0 , __const_10^0 <= 0 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003280s Ranking function: -copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001611s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008189s [57991 : 58058] [57991 : 58059] Successful child: 58058 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000718s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002801s [57991 : 58063] [57991 : 58064] Successful child: 58063 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Ranking function: 1 + __const_11^0 - e^0 New Graphs: [57991 : 58068] [57991 : 58069] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= 0 , [57991 : 58070] [57991 : 58071] INVARIANTS: 1: 0 <= copied^0 + e^0 , 0 <= 1 + copied^0 , Quasi-INVARIANTS to narrow Graph: 1: __const_100^0 + e^0 <= __const_11^0 + n^0 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007279s Ranking function: -4 - 4*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004831s Ranking function: -3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002300s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025702s [57991 : 58072] [57991 : 58073] Successful child: 58072 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014748s [57991 : 58077] [57991 : 58078] Successful child: 58077 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000916s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003543s [57991 : 58082] [57991 : 58083] Successful child: 58082 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Ranking function: 2 + __const_11^0 - e^0 New Graphs: LOG: CALL check - Post:0 <= __const_10^0 - Process 1 * Exit transition: * Postcondition : 0 <= __const_10^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000850s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000987s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , [57991 : 58087] [57991 : 58088] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 0 , [57991 : 58089] [57991 : 58090] [57991 : 58091] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_100^0 + __const_10^0 + e^0 <= __const_11^0 + n^0 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019857s Ranking function: -4 - 4*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014818s Ranking function: -7 - 7*__const_10^0 + 7*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013185s Ranking function: -3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006202s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.607187s [57991 : 58102] [57991 : 58103] Successful child: 58103 Ranking function: -__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.309160s [57991 : 58108] [57991 : 58109] Successful child: 58108 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003943s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.163692s [57991 : 58114] [57991 : 58115] Successful child: 58114 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001124s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004698s [57991 : 58119] [57991 : 58120] Successful child: 58119 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Ranking function: 2 + 2*__const_100^0 + 4*copied^0 + e^0 - 2*n^0 New Graphs: [57991 : 58124] [57991 : 58125] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , [57991 : 58126] [57991 : 58127] [57991 : 58128] [57991 : 58129] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 0 , [57991 : 58130] [57991 : 58131] [57991 : 58132] [57991 : 58133] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044108s Ranking function: -7 - 7*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033628s Ranking function: -10 - 10*__const_10^0 + 10*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023682s Ranking function: 14*__const_10^0 - 14*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012311s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004300s [57991 : 58134] [57991 : 58135] Successful child: 58135 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012135s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.467803s [57991 : 58139] [57991 : 58140] Successful child: 58139 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009200s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.913518s [57991 : 58144] [57991 : 58145] Successful child: 58144 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004569s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.239027s [57991 : 58149] [57991 : 58150] Successful child: 58149 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2*__const_100^0 + __const_10^0 - __const_11^0 + copied^0 + 3*e^0 - 2*n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006068s Ranking function: 1 + 6*__const_100^0 - 2*__const_10^0 + 10*copied^0 + 11*e^0 - 6*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003343s Ranking function: -1 + e^0 New Graphs: [57991 : 58154] [57991 : 58155] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , [57991 : 58156] [57991 : 58157] [57991 : 58158] [57991 : 58159] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58160] [57991 : 58161] [57991 : 58162] [57991 : 58163] [57991 : 58164] [57991 : 58165] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 1 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053269s Ranking function: (~(16) / 3) + (~(16) / 3)*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040251s Ranking function: -10 - 10*__const_10^0 + 10*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028212s Ranking function: 16*__const_10^0 - 16*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012732s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004427s [57991 : 58166] [57991 : 58167] Successful child: 58167 Ranking function: -__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012355s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.003507s [57991 : 58183] [57991 : 58184] Successful child: 58183 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009235s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.020666s [57991 : 58189] [57991 : 58190] Successful child: 58189 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004769s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.254655s [57991 : 58302] [57991 : 58303] Successful child: 58302 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 3*__const_100^0 + __const_11^0 + 7*copied^0 + 7*e^0 - 3*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003725s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58307] [57991 : 58308] [57991 : 58309] [57991 : 58310] [57991 : 58311] [57991 : 58312] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 2 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.077509s Ranking function: -9 - 9*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041101s Ranking function: -10 - 10*__const_10^0 + 10*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027383s Ranking function: 18*__const_10^0 - 18*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012936s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.035280s [57991 : 58313] [57991 : 58314] Successful child: 58314 Ranking function: -__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012580s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005580s [57991 : 58318] [57991 : 58319] Successful child: 58318 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009832s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.260507s [57991 : 58323] [57991 : 58324] Successful child: 58323 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004867s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.335285s [57991 : 58328] [57991 : 58329] Successful child: 58328 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: __const_100^0 + copied^0 + 3*e^0 - n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005446s Ranking function: 6 + (~(1) / 2)*__const_100^0 + (~(5) / 2)*__const_10^0 + (1 / 2)*__const_11^0 + (~(1) / 2)*e^0 + (1 / 2)*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003818s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , 0 <= e^0 , [57991 : 58333] [57991 : 58334] [57991 : 58335] [57991 : 58336] [57991 : 58337] [57991 : 58338] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 3 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.055833s Ranking function: -7 - 7*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046309s Ranking function: 1 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013090s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004211s [57991 : 58339] [57991 : 58340] Successful child: 58340 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012715s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004421s [57991 : 58344] [57991 : 58345] Successful child: 58344 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009427s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.374313s [57991 : 58349] [57991 : 58350] Successful child: 58349 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004896s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.271397s [57991 : 58354] [57991 : 58355] Successful child: 58354 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2*__const_100^0 - 3*__const_10^0 + 4*__const_11^0 + 13*copied^0 + 9*e^0 - 2*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003963s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58450] [57991 : 58451] [57991 : 58452] [57991 : 58453] [57991 : 58454] [57991 : 58455] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 4 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.064335s Ranking function: -7 - 7*__const_10^0 - 7*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052782s Ranking function: 2 - __const_10^0 + __const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027800s Ranking function: 22*__const_10^0 - 22*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013176s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005095s [57991 : 58515] [57991 : 58516] Successful child: 58516 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005350s [57991 : 58733] [57991 : 58734] Successful child: 58733 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009633s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.070916s [57991 : 58738] [57991 : 58739] Successful child: 58738 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004963s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.299444s [57991 : 58743] [57991 : 58744] Successful child: 58743 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2*__const_100^0 - __const_10^0 + __const_11^0 + 12*copied^0 + 11*e^0 - 2*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004101s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58748] [57991 : 58749] [57991 : 58750] [57991 : 58751] [57991 : 58752] [57991 : 58753] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 5 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056917s Ranking function: -7 - 7*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052917s Ranking function: 2 - __const_10^0 + __const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027983s Ranking function: 24*__const_10^0 - 24*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013207s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004392s [57991 : 58754] [57991 : 58755] Successful child: 58755 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012935s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004416s [57991 : 58759] [57991 : 58760] Successful child: 58759 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009739s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.961986s [57991 : 58872] [57991 : 58873] Successful child: 58872 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005006s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.306034s [57991 : 58877] [57991 : 58878] Successful child: 58877 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: -1 + 9*__const_100^0 + 3*__const_11^0 + 63*copied^0 + 57*e^0 - 9*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004300s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58882] [57991 : 58883] [57991 : 58884] [57991 : 58885] [57991 : 58886] [57991 : 58887] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 6 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.061182s Ranking function: -7 - 7*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052733s Ranking function: 2 - __const_10^0 + __const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028081s Ranking function: 26*__const_10^0 - 26*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013235s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004839s [57991 : 58888] [57991 : 58889] Successful child: 58889 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013055s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.003977s [57991 : 58893] [57991 : 58894] Successful child: 58893 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009796s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.954622s [57991 : 58907] [57991 : 58908] Successful child: 58907 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005110s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.302635s [57991 : 58912] [57991 : 58913] Successful child: 58912 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: -3 + 3*__const_100^0 + 13*copied^0 + 22*e^0 - 3*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004410s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58917] [57991 : 58918] [57991 : 58919] [57991 : 58920] [57991 : 58921] [57991 : 58922] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 7 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.058758s Ranking function: -4 - 6*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053177s Ranking function: 2 - __const_10^0 + __const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028290s Ranking function: 28*__const_10^0 - 28*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013379s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005615s [57991 : 58923] [57991 : 58924] Successful child: 58924 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013174s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.007240s [57991 : 58928] [57991 : 58929] Successful child: 58928 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009984s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.333573s [57991 : 58933] [57991 : 58934] Successful child: 58933 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005165s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.304375s [57991 : 58938] [57991 : 58939] Successful child: 58938 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: -10 + 16*__const_100^0 + 113*copied^0 + 129*e^0 - 16*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004545s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58943] [57991 : 58944] [57991 : 58945] [57991 : 58946] [57991 : 58947] [57991 : 58948] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 8 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.059310s Ranking function: -4 - 6*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048061s Ranking function: -10 - 10*__const_10^0 + 10*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028480s Ranking function: 30*__const_10^0 - 30*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013456s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004595s [57991 : 58949] [57991 : 58950] Successful child: 58950 Ranking function: -2*__const_10^0 + __const_11^0 - e^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013259s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.004084s [57991 : 58954] [57991 : 58955] Successful child: 58954 [ 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: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009954s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.196217s [57991 : 58959] [57991 : 58960] Successful child: 58959 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005288s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.303571s [57991 : 58964] [57991 : 58965] Successful child: 58964 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2*__const_100^0 + 16*copied^0 + 19*e^0 - 2*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004653s Ranking function: -1 + e^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= __const_10^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_10^0 <= __const_11^0 , [57991 : 58969] [57991 : 58970] [57991 : 58971] [57991 : 58972] [57991 : 58973] [57991 : 58974] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_10^0 <= 9 , Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.058217s Ranking function: -5 - 5*__const_10^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039305s Ranking function: -10 - 10*__const_10^0 + 10*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1, e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1, e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0, olde^0, oldn^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028717s Ranking function: 32*__const_10^0 - 32*__const_11^0 - 3*copied^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, copied^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013480s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.800129s [57991 : 58975] [57991 : 58976] Timeout expired! [57991 : 58980] [57991 : 58984] Successful child: 58980 Program does NOT terminate