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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
11, 
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, ()] | <line: 12, col: 1> | <line: 16, col: 9> <line: 17, col: 9> <line: 18, col: 9>
main | function | [integer, ()] | <line: 14, col: 1>
i | local variable | integer | <line: 15, col: 5> | <line: 16, col: 5> <line: 19, col: 12> <line: 21, col: 21> <line: 24, col: 9> <line: 24, col: 13>
j | local variable | integer | <line: 15, col: 5> | <line: 17, col: 5> <line: 20, col: 9> <line: 21, col: 16> <line: 22, col: 13> <line: 22, col: 17>
n | local variable | integer | <line: 15, col: 5> | <line: 18, col: 5> <line: 19, col: 16>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (main_i = undef4) /\ (main_n = undef6) /\ (undef4 < undef6), par{main_j -> 0}>
<l0, l11, (main_i = undef4) /\ (main_n = undef6) /\ not((undef4 < undef6)), par{main_j -> undef5}>
<l5, l5, (main_j <= main_i), par{main_j -> (main_j + 1)}>
<l5, l5, not((main_j <= main_i)) /\ ((main_i + 1) < main_n), par{main_i -> (main_i + 1), main_j -> 0}>
<l5, l11, not((main_j <= main_i)) /\ not(((main_i + 1) < main_n)), par{main_i -> (main_i + 1)}>

Fresh variables:
undef4, undef5, undef6, 

Undef variables:
undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:
11, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, main_j <= main_i, {main_j -> 1 + main_j, rest remain the same}>
<l5, l5, 1 + main_i <= main_j /\ 2 + main_i <= main_n, {main_i -> 1 + main_i, main_j -> 0, rest remain the same}>
Variables:
main_i, main_j, main_n

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, 1 + undef4 <= undef6 /\ main_i = undef4 /\ main_n = undef6, {main_j -> 0, rest remain the same}>

Graph 2
<l0, l11, undef6 <= undef4 /\ main_i = undef4 /\ main_n = undef6, {main_j -> undef5, rest remain the same}>
<l5, l11, 1 + main_i <= main_j /\ main_n <= 1 + main_i, {main_i -> 1 + main_i, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 1 )
( 11 , 2 )

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001447s
Ranking function: -main_i + main_n
New Graphs: 
Transitions:
<l5, l5, main_j <= main_i, {main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000764s
Ranking function: main_i - main_j
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l11}...
No cycles found.

Program Terminates