TRS Standard pair #615306665

details

property	value
status	complete
benchmark	#4.17.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n043.star.cs.uiowa.edu
space	Strategy_removed_AG01

run statistics

property	value
solver	AutoNon 1.21
configuration	autonon
runtime (wallclock)	1.52427816391 seconds
cpu usage	4.922300608
max memory	7.10549504E8

stage attributes

key	value
output-size	3985
starexec-result	"NO"

output

/export/starexec/sandbox/solver/bin/starexec_run_autonon /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO

<html>
<body>
<pre style="font-family: monospace, serif; font-size: 1em; white-space: pre-wrap; margin: 20px; padding: 20px;">

*** AutoNon ***


AutoNon proves looping and non-looping non-termination using regular languages.

AutoNon employs SAT solving to find finite automata as certificates of non-termination.
The automata define (a) the language and (b) which rule may be applied where in a term.
By property (b), the language of the automaton does not need to be closed under rewriting.
It suffices that every term in the language admits some rewrite step to a term in the language.
Finally, we employ a quasi-order on the states of the automaton. This allows rewriting to
change the interpretation of a term (the state of the automaton) and thereby to change what
rules may be applied (the allowed rules depend on the state of the automaton).

The technique is described in the following paper:

    [EZ2015] Proving Non-Termination by Finite Automata
             by J. Endrullis and H. Zantema
             Proc. Conf. on Rewriting Techniques and Applications (RTA 2015)

For further information see <a href="http://joerg.endrullis.de/nonterm/">

       http://joerg.endrullis.de/nonterm/       

</a>

*** Input system ***

    f(g(x),s(0),y) -> f(g(s(0)),y,g(x))
    g(s(x)) -> s(g(x))
    g(0) -> 0



*** Non-looping non-termination using regular languages ***


Input system R is not terminating since R admits a regular language weakly closed under rewriting.


The following finite automaton witnesses non-termination:

  The states are: 0,1,...,4

  The accepting states are: 4

  The states determine the rules that may be used:

      state 0:
          g(0) -> 0
      state 1:
          g(s(x)) -> s(g(x))
          g(0) -> 0
      state 2:
          g(0) -> 0
      state 3:
          g(0) -> 0
      state 4:
          f__1(f__2(g(x),s(0)),y) -> f__1(f__2(g(s(0)),y),g(x))
          g(s(x)) -> s(g(x))
          g(0) -> 0

  Transitions for `0':

      out
        0  1
        1   
        2   
        3   
        4   

  Transitions for `f__2':

       x0  0  0  0  0  0  1  1  1  1  1  2  2  2  2  2  3  3  3  3  3  4  4  4  4  4
       x1  0  1  2  3  4  0  1  2  3  4  0  1  2  3  4  0  1  2  3  4  0  1  2  3  4
      out
        0                                                                           
        1                                                                           
        2                                                                           
        3                                   1                                       
        4                                                                           

  Transitions for `s':

       x0  0  1  2  3  4
      out
        0               
        1  1            
        2

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Standard