Dear all,
I'm starting to experimenting the usage of STP as component for
assembly verification.
I'm running STP with the following input file, but it not terminates.
There is some problem in my input program?
Regards
Roberto Guanciale
% free variables:
R_EBP_0 : BITVECTOR(32);
mem_296 : ARRAY BITVECTOR(32) OF BITVECTOR(8);
% end free variables.
>________________________________ > From: Guancio <guan...@gmail.com> >To: stp-users <stp-users@googlegroups.com> >Sent: Tuesday, 15 May 2012 6:30 PM >Subject: Non terminating STP
>Dear all, >I'm starting to experimenting the usage of STP as component for >assembly verification. >I'm running STP with the following input file, but it not terminates. >There is some problem in my input program?
>Regards
>Roberto Guanciale
>% free variables: >R_EBP_0 : BITVECTOR(32); >mem_296 : ARRAY BITVECTOR(32) OF BITVECTOR(8); >% end free variables.
Dear Trevor,
STP is not waiting from STDIN, it consume 100% of one of my cores. I
tried the option you suggested and
I attach the corresponding output.
Roberto
[3ms:12M]Printing: input asserts and query: Node size is: 195
Difficulty Initially:28848
[1ms:12M]Printing: After Removing Unconstrained: Node size is: 195
[1ms:12M]Printing: After Establishing Intervals: Node size is: 195
[2ms:12M]Printing: After Constant Bit Propagation: Node size is: 195
[1ms:12M]Printing: after solving: Node size is: 193
Difficulty After Size reducing:28846
[0ms:12M]Printing: after pure substitution: Node size is: 193
[3ms:12M]Printing: after simplification: Node size is: 136
[0ms:12M]Printing: after solving: Node size is: 136
[1ms:12M]Printing: after pure substitution: Node size is: 136
[0ms:12M]Printing: after simplification: Node size is: 136
[0ms:12M]Printing: after solving: Node size is: 136
[1ms:12M]Printing: After Constant Bit Propagation begins: Node size
is: 136
[0ms:12M]Printing: After Establishing Intervals: Node size is: 136
[0ms:12M]Printing: Before SimplifyWrites_Inplace begins: Node size is:
136
[0ms:12M]Printing: after pure substitution: Node size is: 136
[0ms:12M]Printing: after simplification: Node size is: 136
[0ms:12M]Printing: after solving: Node size is: 136
[1ms:12M]Printing: After SimplifyWrites_Inplace: Node size is: 136
[0ms:12M]Printing: After Unconstrained Remove begins: Node size is:
136
Initial Difficulty Score:28846
Final Difficulty Score:32086
Array Sizes:12 :
[0ms:12M]Printing: after transformation: Node size is: 160
SimplifyMap:0:193
SimplifyNegMap:0:193
AlwaysTrueFormSet0:193
MultInverseMap0:193
ReadOverWrite_NewName_Map0:193
NewName_ReadOverWrite_Map0:193
substn_map0:193
[0ms:12M]Printing: Before Constant Bit Propagation begins: Node size
is: 160
Nodes before AIG rewrite:26005
advanced CNF
============================[ Search
Statistics ]==============================
| Conflicts | ORIGINAL | LEARNT |
Progress |
| | Vars Clauses Literals | Limit Clauses Lit/Cl
| |
=========================================================================== ====
| 100 | 20555 64688 157959 | 23718 100 31 |
1.358 % |
| 250 | 20555 64688 157959 | 26090 250 26 |
1.358 % |
| 475 | 20555 64688 157959 | 28699 475 76 |
1.358 % |
| 812 | 20555 64688 157959 | 31569 812 108 |
1.358 % |
| 1318 | 20555 64688 157959 | 34726 1318 95 |
1.358 % |
| 2077 | 20555 64688 157959 | 38199 2077 99 |
1.358 % |
| 3216 | 20555 64688 157959 | 42019 3216 119 |
1.358 % |
| 4924 | 20555 64688 157959 | 46221 4924 123 |
1.358 % |
| 7486 | 20555 64688 157959 | 50843 7486 121 |
1.358 % |
| 11330 | 20555 64688 157959 | 55928 11330 129 |
1.358 % |
| 17096 | 20555 64688 157959 | 61520 17096 126 |
1.358 % |
On May 15, 2:40 pm, Trevor Hansen <trev_abr...@yahoo.com> wrote:
> >Dear all,
> >I'm starting to experimenting the usage of STP as component for
> >assembly verification.
> >I'm running STP with the following input file, but it not terminates.
> >There is some problem in my input program?
> >Regards
> >Roberto Guanciale
> >% free variables:
> >R_EBP_0 : BITVECTOR(32);
> >mem_296 : ARRAY BITVECTOR(32) OF BITVECTOR(8);
> >% end free variables.
Dear Trevor,
I was using the binary version of STP.
After reading the message http://www.mail-archive.com/klee-...@keeda.stanford.edu/msg00154.html
I decided to compile the svn sources. The problem is now solved.
Roberto
On May 15, 4:59 pm, Guancio <guan...@gmail.com> wrote:
> Dear Trevor,
> STP is not waiting from STDIN, it consume 100% of one of my cores. I
> tried the option you suggested and
> I attach the corresponding output.
> Roberto
> [3ms:12M]Printing: input asserts and query: Node size is: 195
> Difficulty Initially:28848
> [1ms:12M]Printing: After Removing Unconstrained: Node size is: 195
> [1ms:12M]Printing: After Establishing Intervals: Node size is: 195
> [2ms:12M]Printing: After Constant Bit Propagation: Node size is: 195
> [1ms:12M]Printing: after solving: Node size is: 193
> Difficulty After Size reducing:28846
> [0ms:12M]Printing: after pure substitution: Node size is: 193
> [3ms:12M]Printing: after simplification: Node size is: 136
> [0ms:12M]Printing: after solving: Node size is: 136
> [1ms:12M]Printing: after pure substitution: Node size is: 136
> [0ms:12M]Printing: after simplification: Node size is: 136
> [0ms:12M]Printing: after solving: Node size is: 136
> [1ms:12M]Printing: After Constant Bit Propagation begins: Node size
> is: 136
> [0ms:12M]Printing: After Establishing Intervals: Node size is: 136
> [0ms:12M]Printing: Before SimplifyWrites_Inplace begins: Node size is:
> 136
> [0ms:12M]Printing: after pure substitution: Node size is: 136
> [0ms:12M]Printing: after simplification: Node size is: 136
> [0ms:12M]Printing: after solving: Node size is: 136
> [1ms:12M]Printing: After SimplifyWrites_Inplace: Node size is: 136
> [0ms:12M]Printing: After Unconstrained Remove begins: Node size is:
> 136
> Initial Difficulty Score:28846
> Final Difficulty Score:32086
> Array Sizes:12 :
> [0ms:12M]Printing: after transformation: Node size is: 160
> SimplifyMap:0:193
> SimplifyNegMap:0:193
> AlwaysTrueFormSet0:193
> MultInverseMap0:193
> ReadOverWrite_NewName_Map0:193
> NewName_ReadOverWrite_Map0:193
> substn_map0:193
> [0ms:12M]Printing: Before Constant Bit Propagation begins: Node size
> is: 160
> Nodes before AIG rewrite:26005
> advanced CNF
> ============================[ Search
> Statistics ]==============================
> | Conflicts | ORIGINAL | LEARNT |
> Progress |
> | | Vars Clauses Literals | Limit Clauses Lit/Cl
> | |
> =========================================================================== ====
> | 100 | 20555 64688 157959 | 23718 100 31 |
> 1.358 % |
> | 250 | 20555 64688 157959 | 26090 250 26 |
> 1.358 % |
> | 475 | 20555 64688 157959 | 28699 475 76 |
> 1.358 % |
> | 812 | 20555 64688 157959 | 31569 812 108 |
> 1.358 % |
> | 1318 | 20555 64688 157959 | 34726 1318 95 |
> 1.358 % |
> | 2077 | 20555 64688 157959 | 38199 2077 99 |
> 1.358 % |
> | 3216 | 20555 64688 157959 | 42019 3216 119 |
> 1.358 % |
> | 4924 | 20555 64688 157959 | 46221 4924 123 |
> 1.358 % |
> | 7486 | 20555 64688 157959 | 50843 7486 121 |
> 1.358 % |
> | 11330 | 20555 64688 157959 | 55928 11330 129 |
> 1.358 % |
> | 17096 | 20555 64688 157959 | 61520 17096 126 |
> 1.358 % |
> On May 15, 2:40 pm, Trevor Hansen <trev_abr...@yahoo.com> wrote:
> > Hi Guancio,
> > To find out if STP is spending its time doing nothing, or working hard, run it with the command line: -s -t
> > If nothing happens it's probably trying to parse from the STDIN.
> > >Dear all,
> > >I'm starting to experimenting the usage of STP as component for
> > >assembly verification.
> > >I'm running STP with the following input file, but it not terminates.
> > >There is some problem in my input program?