def test_mix_of_concrete_and_symbolic__push_pop_cleaning_store(self):
#global mainsolver
my_solver = Solver()
mem = SMemory(my_solver, 32, 12)
start_mapping_addr = mem.mmap(None, 0x1000, 'rwx')
concrete_addr = start_mapping_addr
symbolic_addr = start_mapping_addr+1
mem.putchar(concrete_addr, 'C')
sym = my_solver.mkBitVec(8)
mem.putchar(symbolic_addr, sym)
my_solver.add(sym.uge(0xfe))
values = list(my_solver.getallvalues(sym))
self.assertIn(0xfe, values)
self.assertIn(0xff, values)
self.assertNotIn(0x7f, values)
values = list(my_solver.getallvalues(mem.getchar(symbolic_addr)))
self.assertIn(0xfe, values)
self.assertIn(0xff, values)
self.assertNotIn(0x7f, values)
my_solver.push()
my_solver.add(sym==0xfe)
values = list(my_solver.getallvalues(sym))
self.assertIn(0xfe, values)
self.assertNotIn(0xff, values)
self.assertNotIn(0x7f, values)
values = list(my_solver.getallvalues(mem.getchar(symbolic_addr)))
self.assertIn(0xfe, values)
self.assertNotIn(0xff, values)
self.assertNotIn(0x7f, values)
my_solver.pop()
values = list(my_solver.getallvalues(sym))
self.assertIn(0xfe, values)
self.assertIn(0xff, values)
self.assertNotIn(0x7f, values)
values = list(my_solver.getallvalues(mem.getchar(symbolic_addr)))
self.assertIn(0xfe, values)
self.assertIn(0xff, values)
self.assertNotIn(0x7f, values)
def testMultiSymbolic(self):
my_solver = Solver()
mem = SMemory(my_solver, 32, 12)
#alloc/map a little mem
size = 0x10000
addr = mem.mmap(None, size, 'rwx')
#initialize first 10 bytes as [100, 101, 102, .. 109]
for i in xrange(addr, addr+10):
mem.putchar(i, chr(100+i-addr))
#Make a char that ranges from 'A' to 'Z'
v = my_solver.mkBitVec(32)
my_solver.add(v>=ord('A'))
my_solver.add(v<=ord('Z'))
#assign it to the firt 10 bytes
mem.putchar(addr+5, chr(v))
#mak a free symbol of 32 bits
x = my_solver.mkBitVec(32)
#constraint it to range into [addr, addr+10)
my_solver.add(x>=addr)
my_solver.add(x<addr+10)
#so now lets ask the memory for values pointed by addr
c = mem.getchar(x)
for val in my_solver.getallvalues(c,1000):
self.assertTrue(val>=100 and val<110 or val >= ord('A') and val <= ord('Z'))
def test_one_concrete_one_symbolic(self):
#global mainsolver
my_solver = Solver()
mem = SMemory(my_solver, 32, 12)
addr_for_symbol1 = mem.mmap(None, 0x1000, 'rwx')
mem.putchar(addr_for_symbol1, 'A')
symbol1 = my_solver.mkBitVec(8)
my_solver.add(OR(symbol1==ord('B'), symbol1==ord('C')))
mem.putchar(addr_for_symbol1+1, symbol1)
values = list(my_solver.getallvalues(symbol1))
self.assertIn(ord('B'), values)
self.assertIn(ord('C'), values)
symbol2 = my_solver.mkBitVec(32)
my_solver.add(symbol2>=addr_for_symbol1)
my_solver.add(symbol2<=addr_for_symbol1+1)
c = mem.getchar(symbol2)
self.assertTrue(issymbolic(c))
values = list(my_solver.getallvalues(c))
self.assertIn(ord('A'), values)
self.assertIn(ord('B'), values)
self.assertIn(ord('C'), values)
def testBasicSymbolic(self):
my_solver = Solver()
mem = SMemory(my_solver, 32, 12)
#alloc/map a little mem
size = 0x10000
addr = mem.mmap(None, size, 'rwx')
#initialize first 10 bytes as [100, 101, 102, .. 109]
for i in xrange(addr, addr+10):
mem.putchar(i, chr(100+i-addr))
#mak a free symbol of 32 bits
x = my_solver.mkBitVec(32)
#constraint it to range into [addr, addr+10)
my_solver.add(x>=addr)
my_solver.add(x<addr+10)
#Well.. x is symbolic
self.assertTrue(issymbolic(x))
#It shall be a solution
self.assertTrue(my_solver.check(), 'sat')
#if we ask for a possible solution (an x that comply with the constraints)
sol = my_solver.getvalue(x)
#it should comply..
self.assertTrue(sol >= addr and sol<addr+10)
#min and max value should be addr and addr+9
m, M = my_solver.minmax(x)
self.assertEqual(m, addr)
self.assertEqual(M, addr+9)
#If we ask for all possible solutions...
for val in my_solver.getallvalues(x):
#any solution must comply..
self.assertTrue(sol >= addr and sol<addr+10)
#so now lets ask the memory for values pointed by addr
c = mem.getchar(x)
for val in my_solver.getallvalues(c):
self.assertTrue(val>=100 and val<110)
#constarint the address a litlle more
my_solver.add(x<=addr)
#It shall be a solution
self.assertTrue(my_solver.check(), 'sat')
#if we ask for a possible solution
sol = my_solver.getvalue(x)
#it must be addr
self.assertTrue(sol == addr)
#lets ask the memory for the value under that address
c = mem.getchar(x)
sol = my_solver.getvalue(c)
self.assertTrue(sol==100)
new_pc=None
vals = None
count += 1
except Exception,e:
test_case_no+=1
if e.message == 'Finished':
print "Program Finnished correctly"
generate_testcase(linux)
elif e.message == "Max number of different solutions hit":
print "Max number of target PCs hit. Checking for wild PC."
solver = linux.solver
solver.push()
try:
#Quick heuristics to determine wild pc
solver.push()
solver.add(linux.cpu.PC == 0x41414141)
if solver.check() == 'sat':
print "PC seems controled!"
solver.pop()
m,M = solver.minmax(linux.cpu.PC)
print "Program counter range: %016x - %016x" %(m,M)
generate_testcase(linux)
finally:
solver.pop()
else:
print Exception, e
generate_testcase(linux)
print '-'*60
traceback.print_exc(file=sys.stdout)
print '-'*60
import pdb
