hacktricks/reversing/reversing-tools-basic-methods/satisfiability-modulo-theories-smt-z3.md

203 lines
7.6 KiB
Markdown
Raw Normal View History

{% hint style="success" %}
Learn & practice AWS Hacking:<img src="/.gitbook/assets/arte.png" alt="" data-size="line">[**HackTricks Training AWS Red Team Expert (ARTE)**](https://training.hacktricks.xyz/courses/arte)<img src="/.gitbook/assets/arte.png" alt="" data-size="line">\
Learn & practice GCP Hacking: <img src="/.gitbook/assets/grte.png" alt="" data-size="line">[**HackTricks Training GCP Red Team Expert (GRTE)**<img src="/.gitbook/assets/grte.png" alt="" data-size="line">](https://training.hacktricks.xyz/courses/grte)
2022-04-28 16:01:33 +00:00
<details>
2022-04-28 16:01:33 +00:00
<summary>Support HackTricks</summary>
2022-04-28 16:01:33 +00:00
* Check the [**subscription plans**](https://github.com/sponsors/carlospolop)!
* **Join the** 💬 [**Discord group**](https://discord.gg/hRep4RUj7f) or the [**telegram group**](https://t.me/peass) or **follow** us on **Twitter** 🐦 [**@hacktricks\_live**](https://twitter.com/hacktricks\_live)**.**
* **Share hacking tricks by submitting PRs to the** [**HackTricks**](https://github.com/carlospolop/hacktricks) and [**HackTricks Cloud**](https://github.com/carlospolop/hacktricks-cloud) github repos.
2022-04-28 16:01:33 +00:00
</details>
{% endhint %}
2022-04-28 16:01:33 +00:00
2022-05-01 16:32:23 +00:00
非常に基本的に、このツールは、いくつかの条件を満たす必要がある変数の値を見つけるのに役立ちます。手作業で計算するのは非常に面倒です。したがって、Z3に変数が満たす必要のある条件を示すと、可能であればいくつかの値を見つけてくれます。
2021-09-08 23:47:00 +00:00
**いくつかのテキストと例は[https://ericpony.github.io/z3py-tutorial/guide-examples.htm](https://ericpony.github.io/z3py-tutorial/guide-examples.htm)から抽出されています**
# 基本操作
2021-09-08 23:47:00 +00:00
## ブール値/AND/OR/NOT
2021-09-08 23:47:00 +00:00
```python
#pip3 install z3-solver
from z3 import *
s = Solver() #The solver will be given the conditions
x = Bool("x") #Declare the symbos x, y and z
y = Bool("y")
z = Bool("z")
# (x or y or !z) and y
s.add(And(Or(x,y,Not(z)),y))
s.check() #If response is "sat" then the model is satifable, if "unsat" something is wrong
print(s.model()) #Print valid values to satisfy the model
```
## 整数/簡略化/実数
2021-09-08 23:47:00 +00:00
```python
from z3 import *
x = Int('x')
y = Int('y')
#Simplify a "complex" ecuation
print(simplify(And(x + 1 >= 3, x**2 + x**2 + y**2 + 2 >= 5)))
#And(x >= 2, 2*x**2 + y**2 >= 3)
#Note that Z3 is capable to treat irrational numbers (An irrational algebraic number is a root of a polynomial with integer coefficients. Internally, Z3 represents all these numbers precisely.)
#so you can get the decimals you need from the solution
r1 = Real('r1')
r2 = Real('r2')
#Solve the ecuation
print(solve(r1**2 + r2**2 == 3, r1**3 == 2))
#Solve the ecuation with 30 decimals
set_option(precision=30)
print(solve(r1**2 + r2**2 == 3, r1**3 == 2))
```
## モデルの印刷
2021-09-08 23:47:00 +00:00
```python
from z3 import *
x, y, z = Reals('x y z')
s = Solver()
s.add(x > 1, y > 1, x + y > 3, z - x < 10)
s.check()
m = s.model()
print ("x = %s" % m[x])
for d in m.decls():
2023-07-07 23:42:27 +00:00
print("%s = %s" % (d.name(), m[d]))
2021-09-08 23:47:00 +00:00
```
# マシン算術
2021-09-08 23:47:00 +00:00
現代のCPUと主流のプログラミング言語は、**固定サイズのビットベクター**に対する算術を使用します。マシン算術はZ3Pyで**ビットベクター**として利用可能です。
2021-09-08 23:47:00 +00:00
```python
from z3 import *
x = BitVec('x', 16) #Bit vector variable "x" of length 16 bit
y = BitVec('y', 16)
e = BitVecVal(10, 16) #Bit vector with value 10 of length 16bits
a = BitVecVal(-1, 16)
b = BitVecVal(65535, 16)
print(simplify(a == b)) #This is True!
a = BitVecVal(-1, 32)
b = BitVecVal(65535, 32)
print(simplify(a == b)) #This is False
```
## 符号付き/符号なしの数
2021-09-08 23:47:00 +00:00
Z3は、**ビットベクターが符号付きまたは符号なしとして扱われるかどうか**が重要な場合に、特別な符号付きの算術演算を提供します。Z3Pyでは、演算子**<, <=, >, >=, /, % および >>**は**符号付き**バージョンに対応しています。対応する**符号なし**演算子は**ULT, ULE, UGT, UGE, UDiv, URem および LShR**です。
2021-09-08 23:47:00 +00:00
```python
from z3 import *
# Create to bit-vectors of size 32
x, y = BitVecs('x y', 32)
solve(x + y == 2, x > 0, y > 0)
# Bit-wise operators
# & bit-wise and
# | bit-wise or
# ~ bit-wise not
solve(x & y == ~y)
solve(x < 0)
2023-07-07 23:42:27 +00:00
# using unsigned version of <
2021-09-08 23:47:00 +00:00
solve(ULT(x, 0))
```
## Functions
2021-09-08 23:47:00 +00:00
**解釈された関数**は、**関数 +**が**固定された標準的な解釈**を持つ算術のようなもので2つの数を加算します。**解釈されていない関数**と定数は**最大限の柔軟性**を持ち、関数や定数に対する**制約**と**一貫性**のある**任意の解釈**を許可します。
2021-09-08 23:47:00 +00:00
fをxに2回適用すると再びxになりますが、fをxに1回適用するとxとは異なります。
2021-09-08 23:47:00 +00:00
```python
from z3 import *
x = Int('x')
y = Int('y')
f = Function('f', IntSort(), IntSort())
s = Solver()
s.add(f(f(x)) == x, f(x) == y, x != y)
s.check()
m = s.model()
print("f(f(x)) =", m.evaluate(f(f(x))))
print("f(x) =", m.evaluate(f(x)))
2021-09-09 12:54:19 +00:00
print(m.evaluate(f(2)))
s.add(f(x) == 4) #Find the value that generates 4 as response
s.check()
print(m.model())
2021-09-08 23:47:00 +00:00
```
2023-07-07 23:42:27 +00:00
# 例
## 数独ソルバー
2021-09-09 12:56:08 +00:00
```python
# 9x9 matrix of integer variables
X = [ [ Int("x_%s_%s" % (i+1, j+1)) for j in range(9) ]
2023-07-07 23:42:27 +00:00
for i in range(9) ]
2021-09-09 12:56:08 +00:00
# each cell contains a value in {1, ..., 9}
cells_c = [ And(1 <= X[i][j], X[i][j] <= 9)
2023-07-07 23:42:27 +00:00
for i in range(9) for j in range(9) ]
2021-09-09 12:56:08 +00:00
# each row contains a digit at most once
rows_c = [ Distinct(X[i]) for i in range(9) ]
# each column contains a digit at most once
cols_c = [ Distinct([ X[i][j] for i in range(9) ])
2023-07-07 23:42:27 +00:00
for j in range(9) ]
2021-09-09 12:56:08 +00:00
# each 3x3 square contains a digit at most once
sq_c = [ Distinct([ X[3*i0 + i][3*j0 + j]
2023-07-07 23:42:27 +00:00
for i in range(3) for j in range(3) ])
for i0 in range(3) for j0 in range(3) ]
2021-09-09 12:56:08 +00:00
sudoku_c = cells_c + rows_c + cols_c + sq_c
# sudoku instance, we use '0' for empty cells
instance = ((0,0,0,0,9,4,0,3,0),
2023-07-07 23:42:27 +00:00
(0,0,0,5,1,0,0,0,7),
(0,8,9,0,0,0,0,4,0),
(0,0,0,0,0,0,2,0,8),
(0,6,0,2,0,1,0,5,0),
(1,0,2,0,0,0,0,0,0),
(0,7,0,0,0,0,5,2,0),
(9,0,0,0,6,5,0,0,0),
(0,4,0,9,7,0,0,0,0))
2021-09-09 12:56:08 +00:00
instance_c = [ If(instance[i][j] == 0,
2023-07-07 23:42:27 +00:00
True,
X[i][j] == instance[i][j])
for i in range(9) for j in range(9) ]
2021-09-09 12:56:08 +00:00
s = Solver()
s.add(sudoku_c + instance_c)
if s.check() == sat:
2023-07-07 23:42:27 +00:00
m = s.model()
r = [ [ m.evaluate(X[i][j]) for j in range(9) ]
for i in range(9) ]
print_matrix(r)
2021-09-09 12:56:08 +00:00
else:
2023-07-07 23:42:27 +00:00
print "failed to solve"
2021-09-09 12:56:08 +00:00
```
## 参考文献
2021-09-09 12:56:08 +00:00
* [https://ericpony.github.io/z3py-tutorial/guide-examples.htm](https://ericpony.github.io/z3py-tutorial/guide-examples.htm)
2022-04-28 16:01:33 +00:00
2022-05-01 16:32:23 +00:00
{% hint style="success" %}
AWSハッキングを学び、練習する<img src="/.gitbook/assets/arte.png" alt="" data-size="line">[**HackTricks Training AWS Red Team Expert (ARTE)**](https://training.hacktricks.xyz/courses/arte)<img src="/.gitbook/assets/arte.png" alt="" data-size="line">\
GCPハッキングを学び、練習する<img src="/.gitbook/assets/grte.png" alt="" data-size="line">[**HackTricks Training GCP Red Team Expert (GRTE)**<img src="/.gitbook/assets/grte.png" alt="" data-size="line">](https://training.hacktricks.xyz/courses/grte)
2022-04-28 16:01:33 +00:00
<details>
2022-04-28 16:01:33 +00:00
<summary>HackTricksをサポートする</summary>
2022-04-28 16:01:33 +00:00
* [**サブスクリプションプラン**](https://github.com/sponsors/carlospolop)を確認してください!
* **💬 [**Discordグループ**](https://discord.gg/hRep4RUj7f)または[**Telegramグループ**](https://t.me/peass)に参加するか、**Twitter** 🐦 [**@hacktricks\_live**](https://twitter.com/hacktricks\_live)**をフォローしてください。**
* **[**HackTricks**](https://github.com/carlospolop/hacktricks)および[**HackTricks Cloud**](https://github.com/carlospolop/hacktricks-cloud)のGitHubリポジトリにPRを提出してハッキングトリックを共有してください。**
2022-04-28 16:01:33 +00:00
</details>
{% endhint %}