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:
<l0, l1, true, seq{main__func_return_ -> 0, main_K -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l9, (main_x = main_K)>
<l2, l3, not((main_x = main_K))>
<l3, l4, (main_x > main_K)>
<l3, l6, not((main_x > main_K))>
<l4, l5, true, seq{main_x -> (main_x - 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_x -> (main_x + 1)}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 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:
<l0, l11, true, seq{main__func_return_ -> 0}>
<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l13, true, seq{main_K -> varCall_1}>
<l13, l14, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l14, l1, true, seq{main_x -> varCall_2}>
<l1, l2, true>
<l2, l9, (main_x = main_K)>
<l2, l3, not((main_x = main_K))>
<l3, l4, (main_x > main_K)>
<l3, l6, not((main_x > main_K))>
<l4, l5, true, seq{main_x -> (main_x - 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_x -> (main_x + 1)}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
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 [4 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 9> <line: 16, col: 9>
main | function | [integer, ()] | <line: 13, col: 1>
K | local variable | integer | <line: 14, col: 5> | <line: 15, col: 5> <line: 17, col: 17> <line: 18, col: 17>
x | local variable | integer | <line: 14, col: 5> | <line: 16, col: 5> <line: 17, col: 12> <line: 18, col: 13> <line: 19, col: 13> <line: 19, col: 17> <line: 21, col: 13> <line: 21, col: 17>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_K = undef3) /\ (main_x = undef4)>
<l2, l10, (main_x = main_K)>
<l2, l2, (main_x < main_K) /\ not((main_x > main_K)), par{main_x -> (main_x + 1)}>
<l2, l2, (main_x > main_K) /\ (main_x > main_K), par{main_x -> (main_x - 1)}>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + main_x <= main_K, {main_x -> 1 + main_x, rest remain the same}>
<l2, l2, 1 + main_K <= main_x, {main_x -> -1 + main_x, rest remain the same}>
Variables:
main_K, main_x

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_K = undef3 /\ main_x = undef4, {all remain the same}>

Graph 2
<l2, l10, main_K = main_x, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 10 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.001576

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000528s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003751s
[6614 : 6616]
[6614 : 6617]
Successful child: 6617
Ranking function: -main_K + main_x
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 1 + main_x <= main_K, {main_x -> 1 + main_x, rest remain the same}>
Variables:
main_K, main_x
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000962s
Ranking function: -1 + main_K - main_x
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l10}...
No cycles found.

Program Terminates