/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

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)}>
<l1, l2, true>
<l2, l3, (main_i < main_j)>
<l2, l5, not((main_i < main_j))>
<l3, l4, true, seq{main_i -> (main_i + 4)}>
<l4, l7, true>
<l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}>
<l6, l7, true>
<l7, l2, true>

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, l8, true, seq{main__func_return_ -> 0}>
<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l9, l10, true, seq{main_i -> varCall_1}>
<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l11, l1, true, seq{main_j -> varCall_2}>
<l1, l2, true>
<l2, l3, (main_i < main_j)>
<l2, l5, not((main_i < main_j))>
<l3, l4, true, seq{main_i -> (main_i + 4)}>
<l4, l7, true>
<l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}>
<l6, l7, true>
<l7, l2, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

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: 3, col: 1> | <line: 8, col: 9> <line: 9, col: 9>
main | function | [integer, ()] | <line: 5, col: 1>
i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 12, col: 13> <line: 13, col: 13> <line: 13, col: 17> <line: 16, col: 13> <line: 16, col: 17>
j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 17> <line: 15, col: 13> <line: 15, col: 17>

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

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + main_i <= main_j, {main_i -> 4 + main_i, rest remain the same}>
<l2, l2, main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000429s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001574s
[11210 : 11212]
[11210 : 11213]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010791s
Time used: 0.010465
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018962s
Time used: 0.018957

LOG: SAT solveNonLinear - Elapsed time: 0.029753s
Cost: 1; Total time: 0.029422
Quasi-ranking function: 50000 - main_i + main_j
New Graphs: 
Transitions:
<l2, l2, 50001 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000474s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001775s
[11210 : 11375]
[11210 : 11376]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011048s
Time used: 0.010621
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020978s
Time used: 0.020973

LOG: SAT solveNonLinear - Elapsed time: 0.032026s
Cost: 1; Total time: 0.031594
Quasi-ranking function: 50000 - main_j
New Graphs: 
Transitions:
<l2, l2, 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000570s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002274s
[11210 : 11380]
[11210 : 11381]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009672s
Time used: 0.009217
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020281s
Time used: 0.020276

LOG: SAT solveNonLinear - Elapsed time: 0.029953s
Cost: 1; Total time: 0.029493
Quasi-ranking function: 50000 - main_i
New Graphs: 
Transitions:
<l2, l2, 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000648s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003143s
[11210 : 11385]
[11210 : 11386]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009895s
Time used: 0.00945
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025390s
Time used: 0.025385

LOG: SAT solveNonLinear - Elapsed time: 0.035285s
Cost: 1; Total time: 0.034835
Quasi-ranking function: 50000 + main_i - 3*main_j
New Graphs: 
Transitions:
<l2, l2, 50001 + main_i <= 3*main_j /\ 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000738s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003288s
[11210 : 11684]
[11210 : 11685]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010351s
Time used: 0.009815
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017591s
Time used: 0.017586

LOG: SAT solveNonLinear - Elapsed time: 0.027941s
Cost: 1; Total time: 0.027401
Quasi-ranking function: 50000 - main_i - main_j
New Graphs: 
Transitions:
<l2, l2, 50001 + main_i <= 3*main_j /\ 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_i + main_j /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000820s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003447s
[11210 : 11850]
[11210 : 11851]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010888s
Time used: 0.010424
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001087s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001165s
Cannot prove unreachability

[11210 : 11855]
[11210 : 11856]
Successful child: 11855

Program does NOT terminate