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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true>
<l2, l3, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}>
<l3, l2, true>
<l2, l4, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}>
<l4, l2, true>
<l5, l1, true>

Fresh variables:
undef2, undef4, 

Undef variables:
undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}>
<l2, l2, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}>

Fresh variables:
undef2, undef4, 

Undef variables:
undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
<l2, l2, 1 <= undef4 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
Variables:
x_5^0

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {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.002513

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001036s
Ranking function: -1 + x_5^0
New Graphs: 
Transitions:
<l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000495s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001476s
[49640 : 49648]
[49640 : 49649]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012824s
Time used: 0.012818

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000547s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001951s
[49640 : 50885]
[49640 : 50886]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005351s
Time used: 0.005021
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[49640 : 52115]
[49640 : 52116]
Successful child: 52116

Program does NOT terminate