/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_i -> 0, main_j -> 5}>
<l1, l2, true>
<l2, l5, not((main_i < 100))>
<l2, l3, (main_i < 100)>
<l3, l4, true, seq{main_i -> (main_i + 1)}>
<l4, l2, true>
<l5, l6, true>
<l6, l9, not((main_j < 21))>
<l6, l7, (main_j < 21)>
<l7, l8, true, seq{main_j -> (main_j + 3)}>
<l8, l6, 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, main_j -> 5}>
<l1, l2, true>
<l2, l3, (main_i < 100)>
<l2, l5, not((main_i < 100))>
<l3, l4, true, seq{main_i -> (main_i + 1)}>
<l4, l2, true>
<l5, l6, true>
<l6, l7, (main_j < 21)>
<l6, l9, not((main_j < 21))>
<l7, l8, true, seq{main_j -> (main_j + 3)}>
<l8, l6, 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 [4 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: 8, col: 5> <line: 11, col: 12> <line: 11, col: 23> <line: 11, col: 27>
j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 13, col: 12> <line: 13, col: 22> <line: 13, col: 26>

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

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 <= 99, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i

Graph 2:
Transitions:
<l6, l6, main_j <= 20, {main_j -> 3 + main_j, rest remain the same}>
Variables:
main_j

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

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

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

Graph 3
<l6, l10, 21 <= main_j, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000509s
Ranking function: 99 - main_i
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001223

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000538s
Ranking function: (20 / 3) + (~(1) / 3)*main_j
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l10}...
No cycles found.

Program Terminates