YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> = ~(10000)))> = ~(10000))> = 1))> = 1)> (main_x - 1)}> (main_x + 1), main_z -> (main_z - 1)}> (main_x + main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> = ~(10000))> = ~(10000)))> = 1)> = 1))> (main_x - 1)}> (main_x + 1), main_z -> (main_z - 1)}> (main_x + main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 16, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = ~(10000)) /\ (undef5 <= 10000) /\ (undef6 <= 10000) /\ (undef5 >= 1), par{main_x -> (undef4 - 1)}> = ~(10000)) /\ (undef5 <= 10000) /\ (undef6 <= 10000) /\ not((undef5 >= 1)), par{main_x -> undef4}> = ~(10000)) /\ (undef5 <= 10000) /\ not((undef6 <= 10000)), par{main_x -> undef4}> = ~(10000)) /\ not((undef5 <= 10000)), par{main_x -> undef4}> = ~(10000))), par{main_x -> undef4}> undef4}> (main_x + 1), main_z -> (main_z - 1)}> = 1), par{main_x -> (main_x - 1), main_y -> (main_x + main_y)}> = 1)), par{main_y -> (main_x + main_y)}> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 16, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 -1 + undef4, rest remain the same}> Graph 2 undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> main_x + main_y, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 9 , 1 ) ( 16 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002668 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000549s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002640s [28404 : 28406] [28404 : 28407] Successful child: 28406 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Ranking function: main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000619s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001886s [28404 : 28411] [28404 : 28412] Successful child: 28411 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: INVARIANTS: 9: 1 <= main_y , 0 <= 1 + main_y , Quasi-INVARIANTS to narrow Graph: 9: [28404 : 28416] [28404 : 28417] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_y <= main_z , main_x + main_y + main_z <= 1 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002250s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000796s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006095s Piecewise ranking function: min(-6 + 3*main_x + 3*main_y + 3*main_z,-3 + 6*main_z) New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000379s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001522s [28404 : 28418] [28404 : 28419] Successful child: 28418 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: [28404 : 28423] [28404 : 28424] [28404 : 28425] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_z <= main_x + main_y , 1 + main_x + main_y <= 0 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002694s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001143s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008097s Piecewise ranking function: min(-3 + 3*main_z,9*main_x + 9*main_y - 6*main_z) New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000725s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007905s Piecewise ranking function: min(-21 + 3*main_x + 3*main_y + 13*main_z,-18 + 16*main_z) New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000383s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001533s [28404 : 28426] [28404 : 28427] Successful child: 28426 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: [28404 : 28431] [28404 : 28432] [28404 : 28433] [28404 : 28434] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_y <= 0 , main_z <= 1 + main_x + main_y , 0 <= 1 + main_y , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003810s Ranking function: -17 + 5*main_x + 6*main_z New Graphs: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002118s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001032s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007806s Piecewise ranking function: min(-3 + 3*main_z,9*main_x + 9*main_y - 6*main_z) New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000738s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007911s Piecewise ranking function: min(-21 + 3*main_x + 3*main_y + 13*main_z,-18 + 16*main_z) New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000387s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001548s [28404 : 28435] [28404 : 28436] Successful child: 28435 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: [28404 : 28440] [28404 : 28441] [28404 : 28442] [28404 : 28443] [28404 : 28444] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_y <= main_z , main_x + main_z <= 0 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003738s Ranking function: -20 + 6*main_x + 7*main_z New Graphs: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002281s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001459s Ranking function: -7 + main_x + 4*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001062s Ranking function: -1 + main_x + main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000390s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001584s [28404 : 28445] [28404 : 28446] Successful child: 28445 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: [28404 : 28450] [28404 : 28451] [28404 : 28452] [28404 : 28453] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_y <= main_z , main_x + main_z <= main_y , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003068s Ranking function: -18 + 6*main_z New Graphs: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002224s Ranking function: -3 + (1 / 2)*main_x + (3 / 2)*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000392s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001607s [28404 : 28454] [28404 : 28455] Successful child: 28454 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> Ranking function: main_x + main_y New Graphs: [28404 : 28459] [28404 : 28460] [28404 : 28461] [28404 : 28462] [28404 : 28463] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: 1 + main_z <= 0 , main_x <= 1 + main_z , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003522s Ranking function: -1 + main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001283s Ranking function: -1 + main_x - main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000434s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001626s [28404 : 28464] [28404 : 28465] Successful child: 28464 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: [28404 : 28469] [28404 : 28470] [28404 : 28471] [28404 : 28472] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: 0 <= main_y , 1 + main_z <= 0 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003501s Ranking function: -1 + main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000427s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001656s [28404 : 28473] [28404 : 28474] Successful child: 28473 [ 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 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x + main_y, 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 + main_x, main_y -> main_x + main_y, rest remain the same}> Ranking function: main_x + main_y New Graphs: [28404 : 28478] [28404 : 28479] [28404 : 28480] [28404 : 28481] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_z <= 0 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003799s Ranking function: -3 + main_z New Graphs: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002249s Ranking function: -2 + main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000742s Ranking function: -1 + main_x + main_z New Graphs: Proving termination of subgraph 2 Analyzing SCC {l16}... No cycles found. Program Terminates