/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, l4, true>
<l1, l2, ((1 + y^0) <= 4000) /\ (undef1 = (1000 + x^0)) /\ (111 <= (0 + undef1)), par{x^0 -> undef1}>
<l2, l1, true>
<l3, l1, true, par{y^0 -> 3000}>
<l4, l3, true>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (3000 = 3000)>
<l1, l1, ((1 + 3000) <= 4000) /\ (undef1 = (1000 + x^0)) /\ (111 <= (0 + undef1)), par{x^0 -> undef1}>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 111 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000528s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001850s
[27982 : 27990]
[27982 : 27991]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009284s
Time used: 0.00928

LOG: SAT solveNonLinear - Elapsed time: 0.013658s
Cost: 1; Total time: 0.013326
Quasi-ranking function: 50000 - x^0
New Graphs: 
Transitions:
<l1, l1, 111 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
Variables:
x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000575s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002183s
[27982 : 29342]
[27982 : 29343]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[27982 : 30685]
[27982 : 30688]
Successful child: 30688

Program does NOT terminate