/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, l12, not((main_i > ~(5)))>
<l3, l4, (main_i > ~(5))>
<l4, l5, (main_i < 5)>
<l4, l12, not((main_i < 5))>
<l5, l6, (main_i < 0)>
<l5, l8, not((main_i < 0))>
<l6, l7, true, seq{main_i -> (main_i + 1)}>
<l7, l8, true>
<l8, l9, (main_i > 0)>
<l8, l11, not((main_i > 0))>
<l9, l10, true, seq{main_i -> (main_i - 1)}>
<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, l12, not((main_i > ~(5)))>
<l4, l5, (main_i < 5)>
<l4, l12, not((main_i < 5))>
<l5, l6, (main_i < 0)>
<l5, l8, not((main_i < 0))>
<l6, l7, true, seq{main_i -> (main_i + 1)}>
<l7, l8, true>
<l8, l9, (main_i > 0)>
<l8, l11, not((main_i > 0))>
<l9, l10, true, seq{main_i -> (main_i - 1)}>
<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: 10, col: 23> <line: 11, col: 17> <line: 12, col: 17> <line: 12, col: 21> <line: 14, col: 17> <line: 15, col: 17> <line: 15, col: 21>

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

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, 1 + main_i <= 0 /\ 0 <= 4 + main_i, {main_i -> 1 + main_i, rest remain the same}>
<l2, l2, 5 + main_i <= 0, {all remain the same}>
<l2, l2, 1 <= main_i /\ main_i <= 4, {main_i -> -1 + main_i, rest remain the same}>
<l2, l2, 5 <= main_i, {all 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.004804

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000908s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013662s
[46895 : 46896]
[46895 : 46897]
Successful child: 46897
Ranking function: main_i
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= 0 /\ 0 <= 4 + main_i, {main_i -> 1 + main_i, rest remain the same}>
<l2, l2, 5 + main_i <= 0, {all remain the same}>
<l2, l2, 5 <= main_i, {all remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000687s
Ranking function: -1 - main_i
New Graphs: 
Transitions:
<l2, l2, 5 + main_i <= 0, {all remain the same}>
<l2, l2, 5 <= main_i, {all remain the same}>
Variables:
main_i
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal 0 <= 4 + main_i and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:0 <= 4 + main_i - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : 0 <= 4 + main_i
Quasi-invariants: 
Location 2: 0 <= 4 + main_i ; 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000453s

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_i /\ main_i <= 4, {main_i -> -1 + main_i, rest remain the same}>
It's unfeasible. Removing transition: 
<l2, l2, 5 <= main_i, {all remain the same}>
ENTRIES:
<l0, l2, 5 + main_i <= 0 /\ main_i = undef2, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 5 + main_i <= 0, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: 0 <= 4 + main_i


LOG: Try proving POST
[46895 : 46901]
[46895 : 46902]
[46895 : 46903]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 4.110908s

[46895 : 46928]
[46895 : 46932]
Successful child: 46932

Program does NOT terminate