/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_N -> ¿functionCall(__VERIFIER_nondet_int), main_i -> main_N}>
<l1, l2, true>
<l2, l10, not((main_i > 0))>
<l2, l3, (main_i > 0)>
<l3, l4, true, seq{main_j -> main_N}>
<l4, l5, true>
<l5, l8, not((main_j > 0))>
<l5, l6, (main_j > 0)>
<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, l1, true, seq{main_N -> varCall_1, main_i -> main_N}>
<l1, l2, true>
<l2, l3, (main_i > 0)>
<l2, l10, not((main_i > 0))>
<l3, l4, true, seq{main_j -> main_N}>
<l4, l5, true>
<l5, l6, (main_j > 0)>
<l5, l8, not((main_j > 0))>
<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: 11, col: 1> | <line: 15, col: 6>
main | function | [integer, ()] | <line: 13, col: 1>
i | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 17, col: 9> <line: 22, col: 3> <line: 22, col: 7>
j | local variable | integer | <line: 14, col: 5> | <line: 18, col: 3> <line: 19, col: 10> <line: 20, col: 4> <line: 20, col: 8>
N | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 16, col: 6> <line: 18, col: 7>

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

Fresh variables:
undef2, 

Undef variables:
undef2, 

Abstraction variables:

Exit nodes:
11, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, 1 <= undef2 /\ main_i = undef2 /\ main_N = undef2, {main_j -> undef2, rest remain the same}>

Graph 2
<l0, l11, undef2 <= 0 /\ main_i = undef2 /\ main_N = undef2, {all remain the same}>
<l5, l11, main_j <= 0 /\ main_i <= 1, {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.005886

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

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

Program Terminates