details

property	value
status	complete
benchmark	peephole.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n051.star.cs.uiowa.edu
space	talp_maria

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.11316108704 seconds
cpu usage	5.266587693
max memory	3.90893568E8

stage attributes

key	value
output-size	247052
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern peephole_opt(g,a) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) NotTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) CallTransformerProof [EQUIVALENT, 0 ms] (4) Prolog (5) CutEliminatorProof [SOUND, 0 ms] (6) Prolog (7) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (8) Prolog (9) CallTransformerProof [EQUIVALENT, 0 ms] (10) Prolog (11) CutEliminatorProof [SOUND, 0 ms] (12) Prolog (13) FailTransformerProof [EQUIVALENT, 0 ms] (14) Prolog (15) UnifyTransformerProof [EQUIVALENT, 0 ms] (16) Prolog (17) OrTransformerProof [EQUIVALENT, 0 ms] (18) Prolog (19) UndefinedPredicateHandlerProof [SOUND, 0 ms] (20) Prolog (21) IntegerArithmeticTransformerProof [SOUND, 0 ms] (22) Prolog (23) NotTransformerProof [EQUIVALENT, 0 ms] (24) Prolog (25) CallTransformerProof [EQUIVALENT, 0 ms] (26) Prolog (27) CutEliminatorProof [SOUND, 0 ms] (28) Prolog (29) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (30) Prolog (31) CallTransformerProof [EQUIVALENT, 0 ms] (32) Prolog (33) CutEliminatorProof [SOUND, 0 ms] (34) Prolog (35) FailTransformerProof [EQUIVALENT, 0 ms] (36) Prolog (37) UnifyTransformerProof [EQUIVALENT, 0 ms] (38) Prolog (39) OrTransformerProof [EQUIVALENT, 0 ms] (40) Prolog (41) UndefinedPredicateHandlerProof [SOUND, 0 ms] (42) Prolog ---------------------------------------- (0) Obligation: Clauses: peephole_opt(Pil, OptPil) :- ','(popt1(Pil, Pil1), ','(popt2(Pil1, Pil2), ','(popt3(Pil2, Pil3), popt4(Pil3, _N, OptPil)))). popt1([], []). popt1(.(Inst, Rest), Pil1) :- popt11(Inst, Rest, Pil1). popt1(.(Inst, Rest), Pil1) :- ','(not(popt11(Inst, Rest, Pil)), ','(=(Pil1, .(Inst, Pil)), popt1(Rest, Pil))). popt11(puttvar(T, R), .(getstr(S, R), PilRest), .(putstr(S, T), OptPilRest)) :- popt1a(PilRest, OptPilRest). popt11(movreg(T, R), .(getstr(S, R), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(getstr(S, T), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(getstr(S, R), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(movreg(T, R), .(puttbreg(R), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(puttbreg(T), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(puttbreg(R), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(movreg(T, R), .(addreg(R, S), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(addreg(T, S), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(addreg(R, S), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(movreg(T, R), .(subreg(R, S), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(subreg(T, S), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(subreg(R, S), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(movreg(T, R), .(mulreg(R, S), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(mulreg(T, S), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(mulreg(R, S), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(movreg(T, R), .(divreg(R, S), PilRest), OptInstList) :- ','(;(','(peep_chk(PilRest, R), =(OptInstList, .(divreg(T, S), OptPilRest))), ','(not(peep_chk(PilRest, R)), =(OptInstList, .(movreg(T, R), .(divreg(R, S), OptPilRest))))), popt1(PilRest, OptPilRest)). popt11(putpvar(V, R), .(getpval(V, R), PilRest), .(putpvar(V, R), OptPilRest)) :- popt1(PilRest, OptPilRest). popt11(putpval(V, R), .(getstr(Str, R), PilRest), .(getstrv(Str, V), OptPilRest)) :- ','(not(=(Str, ','('.', 2))), popt1(PilRest, OptPilRest)). popt11(putpvar(V, R), .(getstr(Str, R), PilRest), .(putstrv(Str, V), OptPilRest)) :- ','(not(=(Str, ','('.', 2))), popt1a(PilRest, OptPilRest)). popt11(gettval(R, R), PRest, OptPRest) :- popt1(PRest, OptPRest). popt11(movreg(R, R), PRest, OptPRest) :- popt1(PRest, OptPRest). popt11(jump(L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jump(Addr), .(jump(_N), PRest), .(jump(Addr), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumpz(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumpnz(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumplt(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumple(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumpgt(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt11(jumpge(_N, L), .(label(L), PRest), .(label(L), OptPRest)) :- popt1(PRest, OptPRest). popt1a([], []). popt1a(.(Inst, PilRest), Pil1) :- popt1a1(Inst, PilRest, Pil1). popt1a(.(Inst, PilRest), Pil1) :- ','(not(popt1a1(Inst, PilRest, Pil1)), ','(=(Pil1, .(Inst, Pil1Rest)), popt1a(PilRest, Pil1Rest))). popt1a1(unipvar(X), PilRest, .(bldpvar(X), OptPilRest)) :- popt1a(PilRest, OptPilRest). popt1a1(unipval(X), PilRest, .(bldpval(X), OptPilRest)) :- popt1a(PilRest, OptPilRest). popout

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

job log

popout

actions

all output return to Logic Progr 19030