/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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:
<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l20, not((main_x > 0))>
<l2, l3, (main_x > 0)>
<l3, l20, not((main_y > 0))>
<l3, l4, (main_y > 0)>
<l4, l5, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
<l4, l12, (¿functionCall(__VERIFIER_nondet_int) = 0)>
<l5, l6, (main_x < main_y)>
<l5, l8, not((main_x < main_y))>
<l6, l7, true, seq{main_y -> (main_x - 1)}>
<l7, l10, true>
<l8, l9, true, seq{main_y -> (main_y - 1)}>
<l9, l10, true>
<l10, l11, true, seq{main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
<l11, l19, true>
<l12, l13, (main_x < main_y)>
<l12, l15, not((main_x < main_y))>
<l13, l14, true, seq{main_x -> (main_x - 1)}>
<l14, l17, true>
<l15, l16, true, seq{main_x -> (main_y - 1)}>
<l16, l17, true>
<l17, l18, true, seq{main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
<l18, l19, true>
<l19, l2, true>
<l20, l21, 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, l22, true, seq{main__func_return_ -> 0}>
<l22, l23, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l23, l24, true, seq{main_x -> varCall_1}>
<l24, l25, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l25, l1, true, seq{main_y -> varCall_2}>
<l1, l2, true>
<l2, l3, (main_x > 0)>
<l2, l20, not((main_x > 0))>
<l3, l4, (main_y > 0)>
<l3, l20, not((main_y > 0))>
<l4, l26, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l26, l12, (varCall_3 = 0)>
<l26, l5, (varCall_3 = 1)>
<l5, l6, (main_x < main_y)>
<l5, l8, not((main_x < main_y))>
<l6, l7, true, seq{main_y -> (main_x - 1)}>
<l7, l10, true>
<l8, l9, true, seq{main_y -> (main_y - 1)}>
<l9, l10, true>
<l10, l27, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l27, l11, true, seq{main_x -> varCall_4}>
<l11, l19, true>
<l12, l13, (main_x < main_y)>
<l12, l15, not((main_x < main_y))>
<l13, l14, true, seq{main_x -> (main_x - 1)}>
<l14, l17, true>
<l15, l16, true, seq{main_x -> (main_y - 1)}>
<l16, l17, true>
<l17, l28, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l28, l18, true, seq{main_y -> varCall_5}>
<l18, l19, true>
<l19, l2, true>
<l20, l21, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
21, 
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: 17, col: 1> | <line: 22, col: 6> <line: 23, col: 6> <line: 25, col: 10> <line: 31, col: 11> <line: 38, col: 11>
main | function | [integer, ()] | <line: 19, col: 1>
x | local variable | integer | <line: 20, col: 2> | <line: 22, col: 2> <line: 24, col: 12> <line: 26, col: 11> <line: 27, col: 12> <line: 31, col: 7> <line: 33, col: 11> <line: 34, col: 8> <line: 34, col: 12> <line: 36, col: 8>
y | local variable | integer | <line: 21, col: 2> | <line: 23, col: 2> <line: 24, col: 21> <line: 26, col: 13> <line: 27, col: 8> <line: 29, col: 8> <line: 29, col: 12> <line: 33, col: 13> <line: 36, col: 12> <line: 38, col: 7>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef6) /\ (main_y = undef7)>
<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 0) /\ (main_x < main_y), par{main_x -> (main_x - 1), main_y -> undef10}>
<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 0) /\ not((main_x < main_y)), par{main_x -> (main_y - 1), main_y -> undef10}>
<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 1) /\ (main_x < main_y), par{main_x -> undef9, main_y -> (main_x - 1)}>
<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 1) /\ not((main_x < main_y)), par{main_x -> undef9, main_y -> (main_y - 1)}>
<l2, l21, (main_x > 0) /\ not((main_y > 0))>
<l2, l21, not((main_x > 0))>

Fresh variables:
undef6, undef7, undef8, undef9, undef10, 

Undef variables:
undef6, undef7, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:
21, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 0, {main_x -> -1 + main_x, main_y -> undef10, rest remain the same}>
<l2, l2, main_y <= main_x /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 0, {main_x -> -1 + main_y, main_y -> undef10, rest remain the same}>
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 1, {main_x -> undef9, main_y -> -1 + main_x, rest remain the same}>
<l2, l2, main_y <= main_x /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 1, {main_x -> undef9, main_y -> -1 + main_y, rest remain the same}>
Variables:
main_x, main_y

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_x = undef6 /\ main_y = undef7, {all remain the same}>

Graph 2
<l2, l21, main_y <= 0 /\ 1 <= main_x, {all remain the same}>
<l2, l21, main_x <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002288s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016277s
Piecewise ranking function: min(-2 + 2*main_y,-2 + 2*main_x)
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l21}...
No cycles found.

Program Terminates