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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, true, par{arg1 -> 1, arg2 -> 2, arg3 -> 3}>
<l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}>
<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>

Fresh variables:
undef7, undef8, undef9, 

Undef variables:
undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 1) /\ (arg2 = 2) /\ (arg3 = 3)>
<l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}>

Fresh variables:
undef7, undef8, undef9, 

Undef variables:
undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {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.007039

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000657s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001641s
[31982 : 31983]
[31982 : 31984]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.066879s
Time used: 0.066613
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[31982 : 31988]
[31982 : 31992]
Successful child: 31988

Program does NOT terminate