/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, par{x^0 -> ((0 + x^0) + y^0), y^0 -> (~(2) + y^0)}>
<l2, l1, true>
<l1, l3, true, par{x^0 -> ((0 + x^0) + z^0), y^0 -> (1 + y^0), z^0 -> (~(2) + z^0)}>
<l3, l1, true>
<l4, l1, (0 <= (0 + x^0))>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (0 <= (0 + x^0))>
<l1, l1, true, par{x^0 -> ((0 + x^0) + y^0), y^0 -> (~(2) + y^0)}>
<l1, l1, true, par{x^0 -> ((0 + x^0) + z^0), y^0 -> (1 + y^0), z^0 -> (~(2) + z^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, true, {x^0 -> x^0 + y^0, y^0 -> -2 + y^0, rest remain the same}>
<l1, l1, true, {x^0 -> x^0 + z^0, y^0 -> 1 + y^0, z^0 -> -2 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 0 <= x^0, {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.004554

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000933s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002122s
[45738 : 45739]
[45738 : 45740]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042259s
Time used: 0.042254

LOG: SAT solveNonLinear - Elapsed time: 0.065534s
Cost: 1; Total time: 0.065176
Quasi-ranking function: 50000 + y^0 + z^0
New Graphs: 
Transitions:
<l1, l1, 50001 + y^0 + z^0 <= 0, {x^0 -> x^0 + y^0, y^0 -> -2 + y^0, rest remain the same}>
<l1, l1, 50001 + y^0 + z^0 <= 0, {x^0 -> x^0 + z^0, y^0 -> 1 + y^0, z^0 -> -2 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000865s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005643s
[45738 : 45744]
[45738 : 45745]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029159s
Time used: 0.029154

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000981s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006206s
[45738 : 45749]
[45738 : 45750]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023536s
Time used: 0.023069
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 0 <= x^0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[45738 : 45754]
[45738 : 45755]
Successful child: 45754

Program does NOT terminate