/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 -> 0}>
<l1, l2, true>
<l2, l9, not((main_i < 100))>
<l2, l3, (main_i < 100)>
<l3, l4, (main_i < 50)>
<l3, l6, not((main_i < 50))>
<l4, l5, true, seq{main_i -> (main_i + 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i - 1)}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, 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, l1, true, seq{main__func_return_ -> 0, main_i -> 0}>
<l1, l2, true>
<l2, l3, (main_i < 100)>
<l2, l9, not((main_i < 100))>
<l3, l4, (main_i < 50)>
<l3, l6, not((main_i < 50))>
<l4, l5, true, seq{main_i -> (main_i + 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i - 1)}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

+                                                                  +
+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++


Function Return and Parameters Information [1 functions]:
    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>
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: 10, col: 27> <line: 11, col: 16> <line: 11, col: 20>

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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, main_i <= 49, {main_i -> 1 + main_i, rest remain the same}>
<l2, l2, 50 <= main_i /\ main_i <= 99, {main_i -> -1 + main_i, rest remain the same}>
Variables:
main_i

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l10, 100 <= main_i, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001456s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008341s
[50768 : 50769]
[50768 : 50770]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.319968s
Time used: 0.319507
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, main_i = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[50768 : 50774]
[50768 : 50778]
Successful child: 50774

Program does NOT terminate