2020-06-23 18:04:17 Full thread dump Java HotSpot(TM) 64-Bit Server VM (25.144-b01 mixed mode): "ThreadPoolThread105" #142 daemon prio=6 os_prio=0 tid=0x00002b1b6408b800 nid=0x9784 waiting on condition [0x0000000000000000] java.lang.Thread.State: RUNNABLE "ThreadPoolThread104" #140 daemon prio=6 os_prio=0 tid=0x00002b1b64046000 nid=0x9783 waiting for monitor entry [0x00002b1bc8806000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x00000004400008b8> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "Thread-115" #139 daemon prio=6 os_prio=0 tid=0x00002b1bc0002800 nid=0x9781 runnable [0x0000000000000000] java.lang.Thread.State: TERMINATED "process reaper" #136 daemon prio=10 os_prio=0 tid=0x00002b1bd8009000 nid=0x977e runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "process reaper" #135 daemon prio=10 os_prio=0 tid=0x00002b1b900d0000 nid=0x977c runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "process reaper" #134 daemon prio=10 os_prio=0 tid=0x00002b1b8400f800 nid=0x9777 waiting on condition [0x00002b1b32aa6000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x000000044095b0f8> (a java.util.concurrent.SynchronousQueue$TransferStack) at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #133 daemon prio=10 os_prio=0 tid=0x00002b1b90096000 nid=0x9775 waiting on condition [0x00002b1b32a6d000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess$ProcessPipeInputStream.processExited(UNIXProcess.java:527) - locked <0x00000006e6778eb8> (a java.lang.UNIXProcess$ProcessPipeInputStream) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:298) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread103" #132 daemon prio=6 os_prio=0 tid=0x00002b1b6402c800 nid=0x9766 waiting for monitor entry [0x00002b1b3373f000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - locked <0x00000004400008b8> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread101" #130 daemon prio=6 os_prio=0 tid=0x00002b1b64089800 nid=0x9757 runnable [0x00002b1bcacd5000] java.lang.Thread.State: RUNNABLE at aprove.DPFramework.BasicStructures.Unification.Unification.buildFinalSubst(Unification.java:272) at aprove.DPFramework.BasicStructures.Unification.Unification.getMgu(Unification.java:121) at aprove.DPFramework.BasicStructures.TRSTerm.getMGU(TRSTerm.java:397) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:531) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread97" #126 daemon prio=6 os_prio=0 tid=0x00002b1b64082800 nid=0x974c runnable [0x00002b1bca8d0000] java.lang.Thread.State: RUNNABLE at java.io.FileInputStream.open0(Native Method) at java.io.FileInputStream.open(FileInputStream.java:195) at java.io.FileInputStream.(FileInputStream.java:138) at java.io.FileReader.(FileReader.java:72) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:317) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread96" #125 daemon prio=6 os_prio=0 tid=0x00002b1b64080800 nid=0x9748 runnable [0x00002b1bca7cf000] java.lang.Thread.State: RUNNABLE at java.io.BufferedReader.close(BufferedReader.java:521) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:71) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158) at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) at aprove.DPFramework.Orders.Solvers.POLOSolver.solveWithoutOptimizing(POLOSolver.java:230) at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:209) at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:53) at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:20) at aprove.DPFramework.DPProblem.Processors.MRRProcessor.processQDPProblem(MRRProcessor.java:61) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread95" #124 daemon prio=6 os_prio=0 tid=0x00002b1b6407e800 nid=0x9742 waiting for monitor entry [0x00002b1bca6cf000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x00000004400008b8> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread94" #123 daemon prio=6 os_prio=0 tid=0x00002b1b6407c800 nid=0x9741 runnable [0x00002b1bca5cd000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(UNIXProcess.java:247) at java.lang.ProcessImpl.start(ProcessImpl.java:134) at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) at java.lang.Runtime.exec(Runtime.java:620) at java.lang.Runtime.exec(Runtime.java:450) at java.lang.Runtime.exec(Runtime.java:347) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:330) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread93" #122 daemon prio=6 os_prio=0 tid=0x00002b1b6407b000 nid=0x9740 runnable [0x00002b1bca4cc000] java.lang.Thread.State: RUNNABLE at aprove.DPFramework.BasicStructures.TRSSubstitution.toMap(TRSSubstitution.java:347) at aprove.DPFramework.BasicStructures.TRSSubstitution.getDomain(TRSSubstitution.java:127) at aprove.DPFramework.BasicStructures.TRSSubstitution.isEmpty(TRSSubstitution.java:258) at aprove.DPFramework.BasicStructures.TRSTerm.applySubstitution(TRSTerm.java:212) at aprove.DPFramework.BasicStructures.Unification.Unification.checkPropernessOfMgu(Unification.java:318) at aprove.DPFramework.BasicStructures.Unification.Unification.getMgu(Unification.java:125) at aprove.DPFramework.BasicStructures.TRSTerm.getMGU(TRSTerm.java:397) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:531) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262) at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "process reaper" #116 daemon prio=10 os_prio=0 tid=0x00002b1bd8001800 nid=0x9739 waiting on condition [0x00002b1bc9fc8000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x000000044095b0f8> (a java.util.concurrent.SynchronousQueue$TransferStack) at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #118 daemon prio=10 os_prio=0 tid=0x00002b1b80003800 nid=0x9738 runnable [0x00002b1bc9f8f000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.waitForProcessExit(Native Method) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #117 daemon prio=10 os_prio=0 tid=0x00002b1bd4001000 nid=0x9735 runnable [0x00002b1bc9f56000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.waitForProcessExit(Native Method) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #115 daemon prio=10 os_prio=0 tid=0x00002b1b7c00a000 nid=0x9732 runnable [0x00002b1b33ff0000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.waitForProcessExit(Native Method) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #112 daemon prio=10 os_prio=0 tid=0x00002b1bb4003800 nid=0x9731 waiting on condition [0x00002b1b33fb7000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x000000044095b0f8> (a java.util.concurrent.SynchronousQueue$TransferStack) at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #113 daemon prio=10 os_prio=0 tid=0x00002b1b8c012000 nid=0x972e waiting for monitor entry [0x00002b1b33f7e000] java.lang.Thread.State: BLOCKED (on object monitor) at java.lang.UNIXProcess$ProcessPipeInputStream.processExited(UNIXProcess.java:527) - locked <0x00000006e5f4dce8> (a java.lang.UNIXProcess$ProcessPipeInputStream) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:298) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #111 daemon prio=10 os_prio=0 tid=0x00002b1b90094800 nid=0x9729 runnable [0x00002b1af7ff3000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.waitForProcessExit(Native Method) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread57" #79 daemon prio=6 os_prio=0 tid=0x00002b1b64027000 nid=0x96ec runnable [0x00002b1b33c43000] java.lang.Thread.State: RUNNABLE at java.lang.Thread.setPriority0(Native Method) at java.lang.Thread.setPriority(Thread.java:1095) at java.lang.Thread.init(Thread.java:417) at java.lang.Thread.init(Thread.java:349) at java.lang.Thread.(Thread.java:448) at aprove.GraphUserInterface.Factories.Solvers.Engines.BufferedStreamInThread.(ExecHelper.java:68) at aprove.GraphUserInterface.Factories.Solvers.Engines.ExecHelper.execAndGetExitCode(ExecHelper.java:46) at aprove.GraphUserInterface.Factories.Solvers.Engines.ExecHelper.exec(ExecHelper.java:25) at aprove.GraphUserInterface.Factories.Solvers.Engines.YicesEngine.solve(YicesEngine.java:159) at aprove.GraphUserInterface.Factories.Solvers.Engines.YicesEngine.solveAndPutIntoFormula(YicesEngine.java:82) at aprove.GraphUserInterface.Factories.Solvers.Engines.YicesEngine.satisfiable(YicesEngine.java:49) at aprove.DPFramework.Orders.Solvers.KBOPOLOSolver.solve(KBOPOLOSolver.java:254) at aprove.DPFramework.TRSProblem.Solvers.KBOPOLOGenericSolver.solveRRR(KBOPOLOGenericSolver.java:43) at aprove.DPFramework.TRSProblem.Processors.QTRSRRRProcessor.processQTRS(QTRSRRRProcessor.java:63) at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread56" #78 daemon prio=6 os_prio=0 tid=0x00002b1b64016000 nid=0x96eb runnable [0x00002b1b3363c000] java.lang.Thread.State: RUNNABLE at java.lang.Thread.setPriority0(Native Method) at java.lang.Thread.setPriority(Thread.java:1095) at java.lang.UNIXProcess.lambda$null$0(UNIXProcess.java:232) at java.lang.UNIXProcess$$Lambda$10/1831117272.newThread(Unknown Source) at java.util.concurrent.ThreadPoolExecutor$Worker.(ThreadPoolExecutor.java:619) at java.util.concurrent.ThreadPoolExecutor.addWorker(ThreadPoolExecutor.java:932) at java.util.concurrent.ThreadPoolExecutor.execute(ThreadPoolExecutor.java:1378) at java.lang.UNIXProcess.initStreams(UNIXProcess.java:288) at java.lang.UNIXProcess.lambda$new$2(UNIXProcess.java:258) at java.lang.UNIXProcess$$Lambda$11/1178271958.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.lang.UNIXProcess.(UNIXProcess.java:257) at java.lang.ProcessImpl.start(ProcessImpl.java:134) at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) at java.lang.Runtime.exec(Runtime.java:620) at java.lang.Runtime.exec(Runtime.java:450) at java.lang.Runtime.exec(Runtime.java:347) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:264) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229) at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201) at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread51" #73 daemon prio=6 os_prio=0 tid=0x00002b1b64036000 nid=0x96e6 waiting on condition [0x00002b1bc8301000] java.lang.Thread.State: RUNNABLE at aprove.Strategies.Abortions.Abortion.abort(Abortion.java:144) - locked <0x00000006a52b6b20> (a aprove.Strategies.Abortions.Abortion) at aprove.Strategies.ExecutableStrategies.Executor.setResult(Executor.java:144) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:327) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread35" #57 daemon prio=6 os_prio=0 tid=0x00002b1b6401e000 nid=0x96d6 runnable [0x00002b1b33239000] java.lang.Thread.State: RUNNABLE at java.io.FileInputStream.readBytes(Native Method) at java.io.FileInputStream.read(FileInputStream.java:255) at java.io.BufferedInputStream.read1(BufferedInputStream.java:284) at java.io.BufferedInputStream.read(BufferedInputStream.java:345) - locked <0x00000006a453a208> (a java.lang.UNIXProcess$ProcessPipeInputStream) at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284) at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326) at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178) - locked <0x00000006a453e8b0> (a java.io.InputStreamReader) at java.io.InputStreamReader.read(InputStreamReader.java:184) at java.io.BufferedReader.fill(BufferedReader.java:161) at java.io.BufferedReader.readLine(BufferedReader.java:324) - locked <0x00000006a453e8b0> (a java.io.InputStreamReader) at java.io.BufferedReader.readLine(BufferedReader.java:389) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:333) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread34" #56 daemon prio=6 os_prio=0 tid=0x00002b1b6401a800 nid=0x96d5 runnable [0x00002b1b32a33000] java.lang.Thread.State: RUNNABLE at java.io.FileInputStream.readBytes(Native Method) at java.io.FileInputStream.read(FileInputStream.java:255) at java.io.BufferedInputStream.read1(BufferedInputStream.java:284) at java.io.BufferedInputStream.read(BufferedInputStream.java:345) - locked <0x00000006a8fa8338> (a java.lang.UNIXProcess$ProcessPipeInputStream) at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284) at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326) at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178) - locked <0x00000006a8fac9e0> (a java.io.InputStreamReader) at java.io.InputStreamReader.read(InputStreamReader.java:184) at java.io.BufferedReader.fill(BufferedReader.java:161) at java.io.BufferedReader.readLine(BufferedReader.java:324) - locked <0x00000006a8fac9e0> (a java.io.InputStreamReader) at java.io.BufferedReader.readLine(BufferedReader.java:389) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:333) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread30" #52 daemon prio=6 os_prio=0 tid=0x00002b1b6401d000 nid=0x96d1 runnable [0x00002b1b33037000] java.lang.Thread.State: RUNNABLE at java.io.FileInputStream.readBytes(Native Method) at java.io.FileInputStream.read(FileInputStream.java:255) at java.io.BufferedInputStream.read1(BufferedInputStream.java:284) at java.io.BufferedInputStream.read(BufferedInputStream.java:345) - locked <0x00000006b861a448> (a java.lang.UNIXProcess$ProcessPipeInputStream) at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284) at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326) at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178) - locked <0x00000006b861ed20> (a java.io.InputStreamReader) at java.io.InputStreamReader.read(InputStreamReader.java:184) at java.io.BufferedReader.fill(BufferedReader.java:161) at java.io.BufferedReader.readLine(BufferedReader.java:324) - locked <0x00000006b861ed20> (a java.io.InputStreamReader) at java.io.BufferedReader.readLine(BufferedReader.java:389) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "process reaper" #36 daemon prio=10 os_prio=0 tid=0x00002b1b74011800 nid=0x96bf runnable [0x00002b1ad7feb000] java.lang.Thread.State: RUNNABLE at java.io.FileDescriptor.closeAll(FileDescriptor.java:195) - locked <0x00000006e5d3d230> (a java.io.FileDescriptor) at java.io.FileOutputStream.close(FileOutputStream.java:354) at java.lang.UNIXProcess$ProcessPipeOutputStream.processExited(UNIXProcess.java:567) - locked <0x00000006e5d3d1f8> (a java.lang.UNIXProcess$ProcessPipeOutputStream) at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:304) at java.lang.UNIXProcess$$Lambda$12/947066388.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "process reaper" #33 daemon prio=10 os_prio=0 tid=0x00002b1b54017800 nid=0x96bb waiting on condition [0x00002b1ad7fb2000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x000000044095b0f8> (a java.util.concurrent.SynchronousQueue$TransferStack) at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread20" #32 daemon prio=6 os_prio=0 tid=0x00002b1b64018000 nid=0x96ba runnable [0x00002b1b32c35000] java.lang.Thread.State: RUNNABLE at java.io.FileInputStream.readBytes(Native Method) at java.io.FileInputStream.read(FileInputStream.java:255) at java.io.BufferedInputStream.read1(BufferedInputStream.java:284) at java.io.BufferedInputStream.read(BufferedInputStream.java:345) - locked <0x00000006af6fc308> (a java.lang.UNIXProcess$ProcessPipeInputStream) at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284) at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326) at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178) - locked <0x00000006af700b90> (a java.io.InputStreamReader) at java.io.InputStreamReader.read(InputStreamReader.java:184) at java.io.BufferedReader.fill(BufferedReader.java:161) at java.io.BufferedReader.readLine(BufferedReader.java:324) - locked <0x00000006af700b90> (a java.io.InputStreamReader) at java.io.BufferedReader.readLine(BufferedReader.java:389) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread14" #26 daemon prio=6 os_prio=0 tid=0x00002b1b64012800 nid=0x96b2 runnable [0x00002b1b32932000] java.lang.Thread.State: RUNNABLE at aprove.Framework.TreeAutomaton.TreeAutomaton.epsTransClosure(TreeAutomaton.java:468) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:288) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.createStateSubstitutions(TRSBoundsTA.java:256) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.collectAllCompatibleConflicts(TRSBounds.java:1666) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:693) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517) at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90) at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread8" #20 daemon prio=6 os_prio=0 tid=0x00002b1b6400b800 nid=0x96ac runnable [0x00002b1af74b6000] java.lang.Thread.State: RUNNABLE at aprove.Framework.Utility.GenericStructures.Pair.equals(Pair.java:66) at java.util.HashMap.getNode(HashMap.java:571) at java.util.HashMap.containsKey(HashMap.java:595) at java.util.HashSet.contains(HashSet.java:203) at java.util.AbstractCollection.containsAll(AbstractCollection.java:318) at java.util.AbstractSet.equals(AbstractSet.java:95) at java.util.HashMap.putVal(HashMap.java:634) at java.util.HashMap.put(HashMap.java:611) at java.util.HashSet.add(HashSet.java:219) at java.util.AbstractCollection.addAll(AbstractCollection.java:344) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:309) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.createStateSubstitutions(TRSBoundsTA.java:256) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.collectAllCompatibleConflicts(TRSBounds.java:1666) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:693) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517) at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90) at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "TimeRefresherThread" #19 daemon prio=6 os_prio=0 tid=0x00002b1b6400b000 nid=0x96ab sleeping[0x00002b1af76b9000] java.lang.Thread.State: TIMED_WAITING (sleeping) at java.lang.Thread.sleep(Native Method) at aprove.Strategies.Abortions.TimeRefresher$TimeRefresherThread.run(TimeRefresher.java:55) "DefaultMachine" #18 daemon prio=6 os_prio=0 tid=0x00002b1ad882a000 nid=0x96aa waiting on condition [0x00002b1af75b8000] java.lang.Thread.State: RUNNABLE at aprove.ProofTree.Obligations.ObligationNode.addTruthValueListener(ObligationNode.java:60) - locked <0x00000006db139630> (a aprove.ProofTree.Obligations.JunctorObligationNode) at aprove.ProofTree.Obligations.BasicObligationNode.addTechnique(BasicObligationNode.java:121) - locked <0x00000006ceb65f88> (a aprove.ProofTree.Obligations.BasicObligationNode) at aprove.Strategies.ExecutableStrategies.ExecResult.exec(ExecResult.java:37) at aprove.Strategies.ExecutableStrategies.ExecProcessorStrategy.finish(ExecProcessorStrategy.java:83) at aprove.Strategies.ExecutableStrategies.ExecProcessorStrategy.exec(ExecProcessorStrategy.java:64) at aprove.Strategies.ExecutableStrategies.ExecFirst.exec(ExecFirst.java:71) at aprove.Strategies.ExecutableStrategies.ExecRepeat.exec(ExecRepeat.java:47) at aprove.Strategies.ExecutableStrategies.ExecAllParallel.exec(ExecAllParallel.java:29) at aprove.Strategies.ExecutableStrategies.ExecSolve.exec(ExecSolve.java:82) at aprove.Strategies.ExecutableStrategies.ExecAny.exec(ExecAny.java:62) at aprove.Strategies.ExecutableStrategies.ExecSolve.exec(ExecSolve.java:82) at aprove.Strategies.ExecutableStrategies.ExecAny.exec(ExecAny.java:62) at aprove.Strategies.ExecutableStrategies.StrategyRoot.evaluateOnce(StrategyRoot.java:35) at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine$CmdExec.run(DefaultMachine.java:247) at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine.run(DefaultMachine.java:174) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread3" #13 daemon prio=5 os_prio=0 tid=0x00002b1ad825e000 nid=0x9678 runnable [0x00002b1af72b4000] java.lang.Thread.State: RUNNABLE at immutables.Immutable.DefaultImmutableList.toArray(Unknown Source) at java.util.ArrayList.(ArrayList.java:177) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.overlapsWith(OverlapClosure.java:177) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.overlapsWith(OverlapClosure.java:121) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:143) at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69) at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread1" #11 daemon prio=5 os_prio=0 tid=0x00002b1ad824e800 nid=0x9676 runnable [0x00002b1af70b2000] java.lang.Thread.State: RUNNABLE at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.overlapsWith(OverlapClosure.java:152) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.overlapsWith(OverlapClosure.java:121) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:143) at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69) at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) at java.lang.Thread.run(Thread.java:748) "Service Thread" #8 daemon prio=9 os_prio=0 tid=0x00002b1ad8187800 nid=0x9660 runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C1 CompilerThread2" #7 daemon prio=9 os_prio=0 tid=0x00002b1ad8184000 nid=0x965f runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C2 CompilerThread1" #6 daemon prio=9 os_prio=0 tid=0x00002b1ad8182000 nid=0x965e runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C2 CompilerThread0" #5 daemon prio=9 os_prio=0 tid=0x00002b1ad817f800 nid=0x965d runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "Signal Dispatcher" #4 daemon prio=9 os_prio=0 tid=0x00002b1ad817e000 nid=0x965c waiting on condition [0x0000000000000000] java.lang.Thread.State: RUNNABLE "Finalizer" #3 daemon prio=8 os_prio=0 tid=0x00002b1ad814a000 nid=0x9657 in Object.wait() [0x00002b1af6709000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x0000000440c98150> (a java.lang.ref.ReferenceQueue$Lock) at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:143) - locked <0x0000000440c98150> (a java.lang.ref.ReferenceQueue$Lock) at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:164) at java.lang.ref.Finalizer$FinalizerThread.run(Finalizer.java:209) "Reference Handler" #2 daemon prio=10 os_prio=0 tid=0x00002b1ad8145800 nid=0x9656 in Object.wait() [0x00002b1af6608000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x0000000440c97688> (a java.lang.ref.Reference$Lock) at java.lang.Object.wait(Object.java:502) at java.lang.ref.Reference.tryHandlePending(Reference.java:191) - locked <0x0000000440c97688> (a java.lang.ref.Reference$Lock) at java.lang.ref.Reference$ReferenceHandler.run(Reference.java:153) "main" #1 prio=5 os_prio=0 tid=0x00002b1ad8008800 nid=0x963d in Object.wait() [0x00002b1ad5e4b000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x000000044000aee8> (a aprove.Strategies.ExecutableStrategies.impl.Handle) at java.lang.Object.wait(Object.java:502) at aprove.Strategies.ExecutableStrategies.impl.Handle.waitForFinish(Handle.java:42) - locked <0x000000044000aee8> (a aprove.Strategies.ExecutableStrategies.impl.Handle) at aprove.Runtime.AProVE.waitForHandle(AProVE.java:32) at aprove.Runtime.AProVE.run(AProVE.java:101) at aprove.CommandLineInterface.Main.run(Main.java:94) at aprove.CommandLineInterface.Main.doMain(Main.java:42) at aprove.Main.doMain(Main.java:54) at aprove.Main.main(Main.java:20) "VM Thread" os_prio=0 tid=0x00002b1ad813e000 nid=0x9654 runnable "GC task thread#0 (ParallelGC)" os_prio=0 tid=0x00002b1ad801e000 nid=0x964b runnable "GC task thread#1 (ParallelGC)" os_prio=0 tid=0x00002b1ad801f800 nid=0x964c runnable "GC task thread#2 (ParallelGC)" os_prio=0 tid=0x00002b1ad8021800 nid=0x964d runnable "GC task thread#3 (ParallelGC)" os_prio=0 tid=0x00002b1ad8023800 nid=0x964e runnable "VM Periodic Task Thread" os_prio=0 tid=0x00002b1ad818a800 nid=0x9661 waiting on condition JNI global references: 364 Heap PSYoungGen total 4281856K, used 1572254K [0x0000000695580000, 0x00000007c0000000, 0x00000007c0000000) eden space 3670528K, 42% used [0x0000000695580000,0x00000006f54e7ad8,0x0000000775600000) from space 611328K, 0% used [0x000000079ab00000,0x000000079ab00000,0x00000007c0000000) to space 611328K, 0% used [0x0000000775600000,0x0000000775600000,0x000000079ab00000) ParOldGen total 9786880K, used 42212K [0x0000000440000000, 0x0000000695580000, 0x0000000695580000) object space 9786880K, 0% used [0x0000000440000000,0x0000000442939018,0x0000000695580000) Metaspace used 21328K, capacity 21526K, committed 21760K, reserved 1069056K class space used 2451K, capacity 2529K, committed 2560K, reserved 1048576K YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 18 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 5 ms] (7) QDP (8) MRRProof [EQUIVALENT, 10 ms] (9) QDP (10) PisEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) UsableRulesProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) QDPOrderProof [EQUIVALENT, 391 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 0 ms] (26) QDP (27) PisEmptyProof [EQUIVALENT, 0 ms] (28) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: R1(a(x1)) -> A(a(a(r1(x1)))) R1(a(x1)) -> A(a(r1(x1))) R1(a(x1)) -> A(r1(x1)) R1(a(x1)) -> R1(x1) R2(a(x1)) -> A(a(a(r2(x1)))) R2(a(x1)) -> A(a(r2(x1))) R2(a(x1)) -> A(r2(x1)) R2(a(x1)) -> R2(x1) A(l1(x1)) -> A(a(a(x1))) A(l1(x1)) -> A(a(x1)) A(l1(x1)) -> A(x1) A(a(l2(x1))) -> A(a(x1)) A(a(l2(x1))) -> A(x1) R2(b(x1)) -> A(b(x1)) B(l1(x1)) -> B(r2(x1)) B(l1(x1)) -> R2(x1) B(l2(x1)) -> B(r1(x1)) B(l2(x1)) -> R1(x1) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 4 SCCs with 9 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: A(l1(x1)) -> A(a(x1)) A(l1(x1)) -> A(a(a(x1))) A(l1(x1)) -> A(x1) A(a(l2(x1))) -> A(a(x1)) A(a(l2(x1))) -> A(x1) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (6) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (7) Obligation: Q DP problem: The TRS P consists of the following rules: A(l1(x1)) -> A(a(x1)) A(l1(x1)) -> A(a(a(x1))) A(l1(x1)) -> A(x1) A(a(l2(x1))) -> A(a(x1)) A(a(l2(x1))) -> A(x1) The TRS R consists of the following rules: a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (8) MRRProof (EQUIVALENT) By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented. Strictly oriented dependency pairs: A(l1(x1)) -> A(a(x1)) A(l1(x1)) -> A(a(a(x1))) A(l1(x1)) -> A(x1) A(a(l2(x1))) -> A(a(x1)) A(a(l2(x1))) -> A(x1) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = x_1 POL(a(x_1)) = x_1 POL(l1(x_1)) = 3 + 2*x_1 POL(l2(x_1)) = 2 + 2*x_1 ---------------------------------------- (9) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (10) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (11) YES ---------------------------------------- (12) Obligation: Q DP problem: The TRS P consists of the following rules: R2(a(x1)) -> R2(x1) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (13) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (14) Obligation: Q DP problem: The TRS P consists of the following rules: R2(a(x1)) -> R2(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (15) QDPSizeChangeProof (EQUIVALENT) By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs: *R2(a(x1)) -> R2(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (16) YES ---------------------------------------- (17) Obligation: Q DP problem: The TRS P consists of the following rules: R1(a(x1)) -> R1(x1) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (18) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (19) Obligation: Q DP problem: The TRS P consists of the following rules: R1(a(x1)) -> R1(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (20) QDPSizeChangeProof (EQUIVALENT) By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs: *R1(a(x1)) -> R1(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (21) YES ---------------------------------------- (22) Obligation: Q DP problem: The TRS P consists of the following rules: B(l2(x1)) -> B(r1(x1)) B(l1(x1)) -> B(r2(x1)) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (23) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(l1(x1)) -> B(r2(x1)) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: <<< POL(B(x_1)) = [[0A]] + [[0A, -I, -I]] * x_1 >>> <<< POL(l2(x_1)) = [[1A], [0A], [0A]] + [[0A, 1A, 0A], [-I, 0A, -I], [-I, 0A, -I]] * x_1 >>> <<< POL(r1(x_1)) = [[0A], [0A], [0A]] + [[0A, 1A, 0A], [1A, 0A, 0A], [0A, 0A, 1A]] * x_1 >>> <<< POL(l1(x_1)) = [[1A], [1A], [-I]] + [[0A, 1A, 0A], [1A, 0A, 0A], [0A, 0A, 0A]] * x_1 >>> <<< POL(r2(x_1)) = [[0A], [0A], [0A]] + [[-I, 0A, -I], [0A, -I, -I], [0A, -I, 0A]] * x_1 >>> <<< POL(a(x_1)) = [[0A], [-I], [-I]] + [[-I, 0A, -I], [0A, -I, -I], [0A, 0A, 0A]] * x_1 >>> <<< POL(b(x_1)) = [[0A], [1A], [0A]] + [[0A, -I, -I], [1A, 0A, 0A], [0A, -I, -I]] * x_1 >>> The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: r1(a(x1)) -> a(a(a(r1(x1)))) r1(b(x1)) -> l1(b(x1)) r2(a(x1)) -> a(a(a(r2(x1)))) r2(b(x1)) -> l2(a(b(x1))) b(l2(x1)) -> b(r1(x1)) b(l1(x1)) -> b(r2(x1)) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) a(a(x1)) -> x1 ---------------------------------------- (24) Obligation: Q DP problem: The TRS P consists of the following rules: B(l2(x1)) -> B(r1(x1)) The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (25) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(l2(x1)) -> B(r1(x1)) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(B(x_1)) = x_1 POL(a(x_1)) = x_1 POL(b(x_1)) = 1 + x_1 POL(l1(x_1)) = 0 POL(l2(x_1)) = 1 POL(r1(x_1)) = 0 POL(r2(x_1)) = 1 + x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: r1(a(x1)) -> a(a(a(r1(x1)))) r1(b(x1)) -> l1(b(x1)) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) a(a(x1)) -> x1 ---------------------------------------- (26) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (27) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (28) YES