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

Fresh variables:

Undef variables:

Abstraction variables:

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

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_i = undef2)>
<l2, l14, (main_i = 0)>
<l2, l2, (main_i < 0) /\ not((main_i > 5)) /\ (main_i < ~(5)), par{main_i -> (main_i - 1)}>
<l2, l2, (main_i < 0) /\ not((main_i > 5)) /\ not((main_i < ~(5))), par{main_i -> 0}>
<l2, l2, (main_i > 0) /\ (main_i > 5), par{main_i -> (main_i + 1)}>
<l2, l2, (main_i > 0) /\ not((main_i > 5)) /\ not((main_i < ~(5))), par{main_i -> 0}>

Fresh variables:
undef2, 

Undef variables:
undef2, 

Abstraction variables:

Exit nodes:
14, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
Variables:
main_i

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_i = undef2, {all remain the same}>

Graph 2
<l2, l14, main_i = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001231s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.033650s
[2469 : 2470]
[2469 : 2471]
Successful child: 2470
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000711s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003331s
Piecewise ranking function: min(-7 + 7*main_i,71 - 6*main_i)
New Graphs: 
Transitions:
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000385s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001145s
[2469 : 2475]
[2469 : 2476]
Successful child: 2475
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000504s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_i , 

LOG: CALL check - Post:main_i <= 5 - Process 2
* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
* Postcondition  : main_i <= 5

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000504s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_i <= 5 , 
Narrowing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: Narrow transition size 2
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
Narrowing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: Narrow transition size 2
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000646s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002940s
[2469 : 2480]
[2469 : 2481]
Successful child: 2480
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
Variables:
main_i
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.001240s
[2469 : 2485]
[2469 : 2486]
Successful child: 2485
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:main_i <= 0 - Process 3
* Exit transition: <l0, l2, 6 <= main_i /\ main_i = undef2, {all remain the same}>
* Postcondition  : main_i <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000650s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_i <= 0 , 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000570s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= 5 + main_i , 
Narrowing transition: 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000658s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002930s
[2469 : 2490]
[2469 : 2491]
Successful child: 2490
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000426s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001235s
[2469 : 2495]
[2469 : 2496]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011196s
Time used: 0.011175

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000406s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001169s
[2469 : 2500]
[2469 : 2501]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004207s
Time used: 0.003915

[2469 : 2621]
[2469 : 2625]
Successful child: 2625

Program does NOT terminate