/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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_q -> ¿functionCall(__VERIFIER_nondet_int), main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}> 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}> 0)> 0))> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | a | local variable | integer | | b | local variable | integer | | q | local variable | integer | | olda | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_a -> ((3 * main_a) - (4 * main_b)), main_b -> ((4 * main_a) + (3 * main_b)), main_q -> ((main_q + main_a) - 1)}> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002658 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000588s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001917s [65233 : 65234] [65233 : 65235] Successful child: 65234 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: LOG: CALL check - Post:main_q <= 0 - Process 1 * Exit transition: * Postcondition : main_q <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000560s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000669s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_q <= 0 , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000549s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002050s [65233 : 65239] [65233 : 65240] Successful child: 65239 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: 13*main_q New Graphs: [65233 : 65244] [65233 : 65245] [65233 : 65246] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= main_a , 0 <= main_b , main_a + main_b + main_q <= 1 , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002075s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.098999s [65233 : 65247] [65233 : 65248] Successful child: 65247 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002362s Ranking function: 2 + 2*main_a - 2*main_b + 4*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000748s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003743s [65233 : 65252] [65233 : 65253] Successful child: 65252 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: main_q New Graphs: [65233 : 65257] [65233 : 65258] [65233 : 65259] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= main_b , [65233 : 65260] [65233 : 65261] [65233 : 65262] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_q <= 1 , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006218s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.599276s [65233 : 65263] [65233 : 65264] Successful child: 65264 Ranking function: 2*main_a - main_b Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003272s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.338013s [65233 : 65268] [65233 : 65269] Successful child: 65269 Ranking function: main_a + 2*main_q Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002438s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.257612s [65233 : 65273] [65233 : 65274] Successful child: 65273 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [65233 : 65278] [65233 : 65279] [65233 : 65280] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= main_b , It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002401s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.258623s [65233 : 65281] [65233 : 65282] Successful child: 65281 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002896s Ranking function: (~(1) / 4) + (~(1) / 4)*main_b + main_q New Graphs: [65233 : 65286] [65233 : 65287] [65233 : 65288] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 4 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002234s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.226209s [65233 : 65289] [65233 : 65290] Successful child: 65289 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: -main_b + 4*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001776s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028876s Piecewise ranking function: min((~(19) / 2) + (~(3) / 2)*main_b + 8*main_q,(~(5) / 2) + (~(1) / 2)*main_b + 2*main_q) New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000933s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004481s [65233 : 65294] [65233 : 65295] Successful child: 65294 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [65233 : 65299] [65233 : 65300] [65233 : 65301] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 6 + main_b , [65233 : 65302] [65233 : 65303] [65233 : 65304] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2 + main_a + main_q <= 0 , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006364s Ranking function: -36 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002912s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.331989s [65233 : 65305] [65233 : 65306] Successful child: 65305 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: -main_b + 4*main_q New Graphs: [65233 : 65310] [65233 : 65311] [65233 : 65312] [65233 : 65313] [65233 : 65314] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 5 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008564s Ranking function: -26 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002731s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.261216s [65233 : 65315] [65233 : 65316] Successful child: 65315 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: -main_b + 4*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000930s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004273s [65233 : 65428] [65233 : 65429] Successful child: 65428 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: -main_a - 34*main_b + 138*main_q New Graphs: [65233 : 65433] [65233 : 65434] [65233 : 65435] [65233 : 65436] [65233 : 65437] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 6 + main_b , [65233 : 65438] [65233 : 65439] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 192 + 4*main_q , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013781s Ranking function: 40 - 4*main_a - 8*main_b + 40*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005104s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.685166s Piecewise ranking function: min(180 - 2*main_b + 8*main_q,194) New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004580s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.976228s [65233 : 65440] [65233 : 65441] Successful child: 65441 Ranking function: main_a - main_b Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003645s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.320637s [65233 : 65445] [65233 : 65446] Successful child: 65445 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [65233 : 65450] [65233 : 65451] [65233 : 65452] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 6 + main_b , It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008440s Ranking function: -25 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003461s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.321560s [65233 : 65453] [65233 : 65454] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076635s Time used: 0.074734 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.180569s Time used: 0.180538 LOG: SAT solveNonLinear - Elapsed time: 0.257204s Cost: 1; Total time: 0.255272 Quasi-ranking function: 50000 - main_a - 2*main_b + 10*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008790s Ranking function: (5004050434 / 100039) + (~(500261) / 100039)*main_b + (300337 / 100039)*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006340s Ranking function: (1 / 100037)*main_a + (~(1) / 100037)*main_b New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002099s Ranking function: (1 / 100043) + (1 / 100043)*main_a + (1 / 100043)*main_q New Graphs: Proving termination of subgraph 2 Analyzing SCC {l6}... No cycles found. Program Terminates