LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::foldCompleteKIndependentSets(unsigned int const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, bool const&)
bool Reductions::foldCompleteKIndependentSets(const uint32_t &theta, unordered_set<uint32_t> **oldCandidateNodes, unordered_set<uint32_t> **newCandidateNodes, const bool &theta4) {
    //cout << "\n**Performing K-Independent set folding reduction**" << endl;
    (*oldCandidateNodes)->clear();
    ReduceInfo old = reduceInfo;
    foldCompleteKIndependentSets2(theta, true, **oldCandidateNodes, **newCandidateNodes, theta4);
    swap(oldCandidateNodes, newCandidateNodes);
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        return false;
    }
    do {
        old = reduceInfo;
        foldCompleteKIndependentSets2(theta, false, **oldCandidateNodes, **newCandidateNodes, theta4);
        swap(oldCandidateNodes, newCandidateNodes);
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x38(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdx, 0x28(%rsp)
movq %rcx, 0x20(%rsp)
movq %r8, 0x18(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0x8(%rsp)
movq 0x28(%rsp), %rax
movq (%rax), %rdi
callq 0x1aed0
movq 0x8(%rsp), %rdi
movl 0x10(%rdi), %eax
movl %eax, 0x14(%rsp)
movq 0x30(%rsp), %rsi
movb $0x1, 0x13(%rsp)
movq 0x28(%rsp), %rax
movq (%rax), %rcx
movq 0x20(%rsp), %rax
movq (%rax), %r8
movq 0x18(%rsp), %r9
leaq 0x13(%rsp), %rdx
callq 0x32070
movq 0x28(%rsp), %rdi
movq 0x20(%rsp), %rsi
callq 0x328c0
movq 0x8(%rsp), %rcx
movl 0x14(%rsp), %eax
cmpl 0x10(%rcx), %eax
jne 0x2ec6d
movb $0x0, 0x47(%rsp)
jmp 0x2ecc6
jmp 0x2ec6f
movq 0x8(%rsp), %rdi
movl 0x10(%rdi), %eax
movl %eax, 0x14(%rsp)
movq 0x30(%rsp), %rsi
movb $0x0, 0x12(%rsp)
movq 0x28(%rsp), %rax
movq (%rax), %rcx
movq 0x20(%rsp), %rax
movq (%rax), %r8
movq 0x18(%rsp), %r9
leaq 0x12(%rsp), %rdx
callq 0x32070
movq 0x28(%rsp), %rdi
movq 0x20(%rsp), %rsi
callq 0x328c0
movq 0x8(%rsp), %rcx
movl 0x14(%rsp), %eax
cmpl 0x10(%rcx), %eax
jne 0x2ec6f
movb $0x1, 0x47(%rsp)
movb 0x47(%rsp), %al
andb $0x1, %al
addq $0x48, %rsp
retq
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeDominatedNodes(unsigned int const&)
bool Reductions::removeDominatedNodes(const uint32_t &theta) {
    //cout << "\n**Performing dominated nodes reduction**" << endl;
    ReduceInfo old = reduceInfo;
    removeDominatedNodes2(theta);
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        //cout << "No nodes removed." << endl;
        return false;
    }
    do {
        old = reduceInfo;
        removeDominatedNodes2(theta);
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movq %rsi, 0x10(%rsp)
movq 0x18(%rsp), %rdi
movq %rdi, (%rsp)
movl 0x10(%rdi), %eax
movl %eax, 0xc(%rsp)
movq 0x10(%rsp), %rsi
callq 0x314d0
movq (%rsp), %rcx
movl 0xc(%rsp), %eax
cmpl 0x10(%rcx), %eax
jne 0x3082c
movb $0x0, 0x27(%rsp)
jmp 0x30855
jmp 0x3082e
movq (%rsp), %rdi
movl 0x10(%rdi), %eax
movl %eax, 0xc(%rsp)
movq 0x10(%rsp), %rsi
callq 0x314d0
movq (%rsp), %rcx
movl 0xc(%rsp), %eax
cmpl 0x10(%rcx), %eax
jne 0x3082e
movb $0x1, 0x27(%rsp)
movb 0x27(%rsp), %al
andb $0x1, %al
addq $0x28, %rsp
retq
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeUnconfinedNodes2()
void Reductions::removeUnconfinedNodes2() {
    Graph::GraphTraversal graphTraversal(graph);
    while (graphTraversal.curNode != NONE) {
        bool isUnconfined = false;
        unordered_set<uint32_t> extendedGrandchildren;
        graph.getExtendedGrandchildren(graphTraversal, extendedGrandchildren, &isUnconfined);
        if (isUnconfined || !graph.isIndependentSet(extendedGrandchildren)) {
            graph.remove(graphTraversal.curNode, reduceInfo);
        }
        graph.getNextNode(graphTraversal);
    }
}

// Assembly:
subq $0x88, %rsp
movq %rdi, 0x80(%rsp)
movq 0x80(%rsp), %rax
movq %rax, 0x18(%rsp)
movq (%rax), %rsi
leaq 0x78(%rsp), %rdi
callq 0x2a40
cmpl $-0x1, 0x78(%rsp)
je 0x32a01
movb $0x0, 0x77(%rsp)
leaq 0x38(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x1a020
movq 0x18(%rsp), %rax
movq 0x10(%rsp), %rdx
movq (%rax), %rdi
movb $0x0, 0x37(%rsp)
leaq 0x78(%rsp), %rsi
leaq 0x77(%rsp), %rcx
leaq 0x37(%rsp), %r8
callq 0x4f80
jmp 0x32970
testb $0x1, 0x77(%rsp)
jne 0x329a0
movq 0x18(%rsp), %rax
movq (%rax), %rdi
xorl %eax, %eax
movl %eax, %ecx
leaq 0x38(%rsp), %rsi
movq %rcx, %rdx
callq 0x33b40
movb %al, 0xf(%rsp)
jmp 0x32996
movb 0xf(%rsp), %al
testb $0x1, %al
jne 0x329de
jmp 0x329a0
movq 0x18(%rsp), %rdx
movq (%rdx), %rdi
addq $0x10, %rdx
movb $0x0, 0x23(%rsp)
leaq 0x78(%rsp), %rsi
leaq 0x23(%rsp), %rcx
callq 0x32f0
jmp 0x329c2
jmp 0x329de
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x28(%rsp)
movl %eax, 0x24(%rsp)
leaq 0x38(%rsp), %rdi
callq 0x1a030
jmp 0x32a09
movq 0x18(%rsp), %rax
movq (%rax), %rdi
leaq 0x78(%rsp), %rsi
callq 0x185f0
jmp 0x329f2
leaq 0x38(%rsp), %rdi
callq 0x1a030
jmp 0x32929
addq $0x88, %rsp
retq
movq 0x28(%rsp), %rdi
callq 0x2310
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::findClique(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>*, unsigned int const&)
bool Reductions::findClique(vector<Graph::GraphTraversal> &clique, vector<Graph::GraphTraversal> *previousClique, const uint32_t &cliqueSize) {
    Graph::GraphTraversal graphTraversal = clique[0];
    if (graphTraversal.curNode == NONE) {
        return false;
    }
    while (clique.size() < cliqueSize) {
        uint32_t neighbor = (*graph.edgeBuffer)[graphTraversal.curEdgeOffset];
        bool existsInPreviousClique = (previousClique == NULL ? false : find(neighbor, *previousClique));
        if (!existsInPreviousClique && !find(neighbor, clique) && isSubsetOfNeighbors(clique, neighbor, graph)) {
            graph.goToNode(neighbor, graphTraversal);
            clique.push_back(graphTraversal);
        } else {
            if (!Graph::advance(clique, graphTraversal, graph)) {
                return false;
            }
        }
    }
    return true;
}

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x38(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdx, 0x28(%rsp)
movq %rcx, 0x20(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0x8(%rsp)
movq 0x30(%rsp), %rdi
xorl %eax, %eax
movl %eax, %esi
callq 0x33f00
movq (%rax), %rax
movq %rax, 0x18(%rsp)
cmpl $-0x1, 0x18(%rsp)
jne 0x32a69
movb $0x0, 0x47(%rsp)
jmp 0x32b60
jmp 0x32a6b
movq 0x30(%rsp), %rdi
callq 0x33f20
movq 0x20(%rsp), %rcx
movl (%rcx), %ecx
cmpq %rcx, %rax
jae 0x32b5b
movq 0x8(%rsp), %rax
movq (%rax), %rax
movq 0x18(%rax), %rdi
movl 0x1c(%rsp), %eax
movl %eax, %esi
callq 0x18900
movl (%rax), %eax
movl %eax, 0x14(%rsp)
cmpq $0x0, 0x28(%rsp)
jne 0x32ab2
xorl %eax, %eax
movb %al, 0x7(%rsp)
jmp 0x32ac5
movq 0x28(%rsp), %rsi
leaq 0x14(%rsp), %rdi
callq 0x33f40
movb %al, 0x7(%rsp)
movb 0x7(%rsp), %al
andb $0x1, %al
movb %al, 0x13(%rsp)
testb $0x1, 0x13(%rsp)
jne 0x32b2e
movq 0x30(%rsp), %rsi
leaq 0x14(%rsp), %rdi
callq 0x33f40
testb $0x1, %al
jne 0x32b2e
movq 0x8(%rsp), %rax
movq 0x30(%rsp), %rdi
movq (%rax), %rdx
leaq 0x14(%rsp), %rsi
callq 0x33fc0
testb $0x1, %al
jne 0x32b06
jmp 0x32b2e
movq 0x8(%rsp), %rax
movq (%rax), %rdi
leaq 0x14(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x187b0
movq 0x30(%rsp), %rdi
leaq 0x18(%rsp), %rsi
callq 0x340e0
jmp 0x32b56
movq 0x8(%rsp), %rax
movq 0x30(%rsp), %rdi
movq (%rax), %rdx
leaq 0x18(%rsp), %rsi
xorl %eax, %eax
movl %eax, %ecx
callq 0x34150
testb $0x1, %al
jne 0x32b54
movb $0x0, 0x47(%rsp)
jmp 0x32b60
jmp 0x32b56
jmp 0x32a6b
movb $0x1, 0x47(%rsp)
movb 0x47(%rsp), %al
andb $0x1, %al
addq $0x48, %rsp
retq
nopl (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::findMisInComponent(std::vector<unsigned int, std::allocator<unsigned int>> const&)
void Reductions::findMisInComponent(const vector<uint32_t> &cc) {
    unordered_set<uint32_t> removedNodes;
    for (auto node : cc) {
        if (removedNodes.find(node) == removedNodes.end()) {
            mis.getMis().push_back(node);
            Graph::GraphTraversal graphTraversal(graph, node);
            while (graphTraversal.curEdgeOffset != NONE) {
                removedNodes.insert((*graph.edgeBuffer)[graphTraversal.curEdgeOffset]);
                graph.getNextEdge(graphTraversal);
            }
        }
    }
}

// Assembly:
subq $0xc8, %rsp
movq %rdi, 0xc0(%rsp)
movq %rsi, 0xb8(%rsp)
movq 0xc0(%rsp), %rax
movq %rax, 0x20(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x1a020
movq 0xb8(%rsp), %rax
movq %rax, 0x78(%rsp)
movq 0x78(%rsp), %rdi
callq 0x193b0
movq %rax, 0x70(%rsp)
movq 0x78(%rsp), %rdi
callq 0x19420
movq %rax, 0x68(%rsp)
leaq 0x70(%rsp), %rdi
leaq 0x68(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x32be4
jmp 0x32d13
leaq 0x70(%rsp), %rdi
callq 0x19450
movl (%rax), %eax
movl %eax, 0x64(%rsp)
leaq 0x80(%rsp), %rdi
leaq 0x64(%rsp), %rsi
callq 0x192c0
movq %rax, 0x18(%rsp)
jmp 0x32c0d
movq 0x18(%rsp), %rax
movq %rax, 0x58(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x19250
movq %rax, 0x40(%rsp)
leaq 0x58(%rsp), %rdi
leaq 0x40(%rsp), %rsi
callq 0x1a690
testb $0x1, %al
jne 0x32c41
jmp 0x32d02
movq 0x20(%rsp), %rax
movq 0x8(%rax), %rdi
callq 0x33930
movq %rax, 0x10(%rsp)
jmp 0x32c56
movq 0x10(%rsp), %rdi
leaq 0x64(%rsp), %rsi
callq 0x19070
jmp 0x32c67
movq 0x20(%rsp), %rax
movq (%rax), %rsi
leaq 0x38(%rsp), %rdi
leaq 0x64(%rsp), %rdx
callq 0x2a70
jmp 0x32c80
jmp 0x32c82
cmpl $-0x1, 0x3c(%rsp)
je 0x32d00
movq 0x20(%rsp), %rax
movq (%rax), %rax
movq 0x18(%rax), %rdi
movl 0x3c(%rsp), %eax
movl %eax, %esi
callq 0x18900
movq %rax, %rsi
leaq 0x80(%rsp), %rdi
callq 0x18960
movb %dl, 0x7(%rsp)
movq %rax, 0x8(%rsp)
jmp 0x32cbb
movq 0x20(%rsp), %rax
movb 0x7(%rsp), %cl
movq 0x8(%rsp), %rdx
movq %rdx, 0x28(%rsp)
movb %cl, 0x30(%rsp)
movq (%rax), %rdi
leaq 0x38(%rsp), %rsi
callq 0x19560
jmp 0x32ce1
jmp 0x32c82
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x50(%rsp)
movl %eax, 0x4c(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x1a030
jmp 0x32d28
jmp 0x32d02
jmp 0x32d04
leaq 0x70(%rsp), %rdi
callq 0x23ff0
jmp 0x32bcc
leaq 0x80(%rsp), %rdi
callq 0x1a030
addq $0xc8, %rsp
retq
movq 0x50(%rsp), %rdi
callq 0x2310
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: bool Graph::isIndependentSet<std::vector<unsigned int, std::allocator<unsigned int>>>(std::vector<unsigned int, std::allocator<unsigned int>> const&, unsigned int*, unsigned int*) const
bool isIndependentSet(const Container &set, uint32_t *node1 = NULL, uint32_t *node2 = NULL) const {
        for (auto i = set.begin() ; i != set.end() ; i++) {
            for (auto j = std::next(i, 1) ; j != set.end() ; j++) {
                if (edgeExists(*i, *j)) {
                    if (node1 != NULL && node2 != NULL) {
                        *node1 = *i;
                        *node2 = *j;
                    }
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
subq $0x78, %rsp
movq %rdi, 0x68(%rsp)
movq %rsi, 0x60(%rsp)
movq %rdx, 0x58(%rsp)
movq %rcx, 0x50(%rsp)
movq 0x68(%rsp), %rax
movq %rax, 0x10(%rsp)
movq 0x60(%rsp), %rdi
callq 0x193b0
movq %rax, 0x48(%rsp)
movq 0x60(%rsp), %rdi
callq 0x19420
movq %rax, 0x40(%rsp)
leaq 0x48(%rsp), %rdi
leaq 0x40(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x33a48
jmp 0x33b2b
movq 0x48(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movl $0x1, %esi
callq 0x23f30
movq %rax, 0x38(%rsp)
movq 0x60(%rsp), %rdi
callq 0x19420
movq %rax, 0x28(%rsp)
leaq 0x38(%rsp), %rdi
leaq 0x28(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x33a8d
jmp 0x33b13
leaq 0x48(%rsp), %rdi
callq 0x19450
movq %rax, 0x8(%rsp)
leaq 0x38(%rsp), %rdi
callq 0x19450
movq 0x10(%rsp), %rdi
movq 0x8(%rsp), %rsi
movq %rax, %rdx
callq 0x18920
testb $0x1, %al
jne 0x33abe
jmp 0x33afb
cmpq $0x0, 0x58(%rsp)
je 0x33af4
cmpq $0x0, 0x50(%rsp)
je 0x33af4
leaq 0x48(%rsp), %rdi
callq 0x19450
movl (%rax), %ecx
movq 0x58(%rsp), %rax
movl %ecx, (%rax)
leaq 0x38(%rsp), %rdi
callq 0x19450
movl (%rax), %ecx
movq 0x50(%rsp), %rax
movl %ecx, (%rax)
movb $0x0, 0x77(%rsp)
jmp 0x33b30
jmp 0x33afd
leaq 0x38(%rsp), %rdi
xorl %esi, %esi
callq 0x19730
movq %rax, 0x20(%rsp)
jmp 0x33a66
jmp 0x33b15
leaq 0x48(%rsp), %rdi
xorl %esi, %esi
callq 0x19730
movq %rax, 0x18(%rsp)
jmp 0x33a21
movb $0x1, 0x77(%rsp)
movb 0x77(%rsp), %al
andb $0x1, %al
addq $0x78, %rsp
retq
nopl (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::nodeDegreesEqualTo(std::vector<unsigned int, std::allocator<unsigned int>>&, unsigned int const&, Graph const&)
static bool nodeDegreesEqualTo(std::vector<uint32_t> &nodes, const uint32_t &degree, const Graph &graph) {
        for (auto node : nodes) {
            if (graph.getNodeDegree(node) != degree) {
                return false;
            }
        }
        return true;
    }

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x38(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdx, 0x28(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0x20(%rsp)
movq 0x20(%rsp), %rdi
callq 0x19b50
movq %rax, 0x18(%rsp)
movq 0x20(%rsp), %rdi
callq 0x1a0e0
movq %rax, 0x10(%rsp)
leaq 0x18(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x1a110
testb $0x1, %al
jne 0x33e00
jmp 0x33e3d
leaq 0x18(%rsp), %rdi
callq 0x1a150
movl (%rax), %eax
movl %eax, 0xc(%rsp)
movq 0x28(%rsp), %rdi
leaq 0xc(%rsp), %rsi
callq 0x1a040
movq 0x30(%rsp), %rcx
cmpl (%rcx), %eax
je 0x33e2f
movb $0x0, 0x47(%rsp)
jmp 0x33e42
jmp 0x33e31
leaq 0x18(%rsp), %rdi
callq 0x1a160
jmp 0x33deb
movb $0x1, 0x47(%rsp)
movb 0x47(%rsp), %al
andb $0x1, %al
addq $0x48, %rsp
retq
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::find(unsigned int const&, std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>> const&)
static bool find(const uint32_t &node, const std::vector<Graph::GraphTraversal> &set) {
        for (uint32_t i = 0 ; i < set.size() ; i++) {
            if (set[i].curNode == node) {
                return true;
            }
        }
        return false;
    }

// Assembly:
subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movq %rsi, 0x10(%rsp)
movl $0x0, 0xc(%rsp)
movl 0xc(%rsp), %eax
movq %rax, (%rsp)
movq 0x10(%rsp), %rdi
callq 0x33f20
movq %rax, %rcx
movq (%rsp), %rax
cmpq %rcx, %rax
jae 0x33fa5
movq 0x10(%rsp), %rdi
movl 0xc(%rsp), %eax
movl %eax, %esi
callq 0x34950
movl (%rax), %eax
movq 0x18(%rsp), %rcx
cmpl (%rcx), %eax
jne 0x33f96
movb $0x1, 0x27(%rsp)
jmp 0x33faa
jmp 0x33f98
movl 0xc(%rsp), %eax
addl $0x1, %eax
movl %eax, 0xc(%rsp)
jmp 0x33f56
movb $0x0, 0x27(%rsp)
movb 0x27(%rsp), %al
andb $0x1, %al
addq $0x28, %rsp
retq
nopw %cs:(%rax,%rax)
nop
// File: iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::isSubsetOfNeighbors(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>> const&, unsigned int const&, Graph const&)
static bool isSubsetOfNeighbors(const std::vector<Graph::GraphTraversal> &subset, const uint32_t &node, const Graph &graph) {
        uint32_t pos = graph.getPos(node);
        uint32_t count = subset.size();
        uint32_t nextNodeOffset = (pos == graph.nodeIndex.size()-1 ? graph.edgeBuffer->size() : graph.nodeIndex[pos+1].offset);
        for (uint32_t offset = graph.nodeIndex[pos].offset ; count && offset < nextNodeOffset ; offset++) {
            if (find((*graph.edgeBuffer)[offset], subset)) {
                count--;
            }
        }
        return !count;
    }

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq %rdx, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq 0x38(%rsp), %rsi
callq 0x339a0
movl %eax, 0x2c(%rsp)
movq 0x40(%rsp), %rdi
callq 0x33f20
movl %eax, 0x28(%rsp)
movl 0x2c(%rsp), %eax
movq %rax, 0x18(%rsp)
movq 0x30(%rsp), %rdi
callq 0x18830
movq %rax, %rcx
movq 0x18(%rsp), %rax
subq $0x1, %rcx
cmpq %rcx, %rax
jne 0x3402d
movq 0x30(%rsp), %rax
movq 0x18(%rax), %rdi
callq 0x188e0
movq %rax, 0x10(%rsp)
jmp 0x34049
movq 0x30(%rsp), %rdi
movl 0x2c(%rsp), %eax
addl $0x1, %eax
movl %eax, %eax
movl %eax, %esi
callq 0x18850
movl (%rax), %eax
movq %rax, 0x10(%rsp)
movq 0x10(%rsp), %rax
movl %eax, 0x24(%rsp)
movq 0x30(%rsp), %rdi
movl 0x2c(%rsp), %eax
movl %eax, %esi
callq 0x18850
movl (%rax), %eax
movl %eax, 0x20(%rsp)
xorl %eax, %eax
cmpl $0x0, 0x28(%rsp)
movb %al, 0xf(%rsp)
je 0x34084
movl 0x20(%rsp), %eax
cmpl 0x24(%rsp), %eax
setb %al
movb %al, 0xf(%rsp)
movb 0xf(%rsp), %al
testb $0x1, %al
jne 0x3408e
jmp 0x340cf
movq 0x30(%rsp), %rax
movq 0x18(%rax), %rdi
movl 0x20(%rsp), %eax
movl %eax, %esi
callq 0x18900
movq %rax, %rdi
movq 0x40(%rsp), %rsi
callq 0x33f40
testb $0x1, %al
jne 0x340b5
jmp 0x340c0
movl 0x28(%rsp), %eax
addl $-0x1, %eax
movl %eax, 0x28(%rsp)
jmp 0x340c2
movl 0x20(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x20(%rsp)
jmp 0x34068
cmpl $0x0, 0x28(%rsp)
setne %al
xorb $-0x1, %al
andb $0x1, %al
addq $0x48, %rsp
retq
// File: iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: Graph::advance(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, Graph::GraphTraversal&, Graph const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>*)
static bool advance(std::vector<Graph::GraphTraversal> &frontier, Graph::GraphTraversal &graphTraversal, const Graph &graph, std::unordered_set<uint32_t> *set = NULL) {
        bool validNeighbor = false;
        while(!validNeighbor) {
            graphTraversal = frontier.back();
            graph.getNextEdge(graphTraversal);
            frontier.back() = graphTraversal;
            if (graphTraversal.curEdgeOffset != NONE) {
                validNeighbor = true;
            } else {
                graphTraversal = frontier.back();
                if (set != NULL) {
                    set->erase(graphTraversal.curNode);
                }
                frontier.pop_back();
                if (frontier.empty()) {
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
subq $0x38, %rsp
movq %rdi, 0x28(%rsp)
movq %rsi, 0x20(%rsp)
movq %rdx, 0x18(%rsp)
movq %rcx, 0x10(%rsp)
movb $0x0, 0xf(%rsp)
movb 0xf(%rsp), %al
xorb $-0x1, %al
testb $0x1, %al
jne 0x3417c
jmp 0x34229
movq 0x28(%rsp), %rdi
callq 0x34970
movq %rax, %rcx
movq 0x20(%rsp), %rax
movq (%rcx), %rcx
movq %rcx, (%rax)
movq 0x18(%rsp), %rdi
movq 0x20(%rsp), %rsi
callq 0x19560
movq 0x20(%rsp), %rax
movq %rax, (%rsp)
movq 0x28(%rsp), %rdi
callq 0x34970
movq (%rsp), %rcx
movq (%rcx), %rcx
movq %rcx, (%rax)
movq 0x20(%rsp), %rax
cmpl $-0x1, 0x4(%rax)
je 0x341d2
movb $0x1, 0xf(%rsp)
jmp 0x34224
movq 0x28(%rsp), %rdi
callq 0x34970
movq %rax, %rcx
movq 0x20(%rsp), %rax
movq (%rcx), %rcx
movq %rcx, (%rax)
cmpq $0x0, 0x10(%rsp)
je 0x34201
movq 0x10(%rsp), %rdi
movq 0x20(%rsp), %rsi
callq 0x1a890
movq 0x28(%rsp), %rdi
callq 0x349b0
movq 0x28(%rsp), %rdi
callq 0x349d0
testb $0x1, %al
jne 0x3421b
jmp 0x34222
movb $0x0, 0x37(%rsp)
jmp 0x3422e
jmp 0x34224
jmp 0x3416d
movb $0x1, 0x37(%rsp)
movb 0x37(%rsp), %al
andb $0x1, %al
addq $0x38, %rsp
retq
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::SearchNode::handleCuts()
bool Alg::SearchNode::handleCuts() {
    bool connected;
    if (graph.getArticulationPoints(cut, c1, c2, actualComponent1, connected) || connected && (graph.getSeparatingPairs(cut, c1, c2, actualComponent1) || graph.getSeparatingTriplets(cut, c1, c2, actualComponent1))) {
        branchingRule.type = BranchingRule::Type::CUT;
        hasCut = true;
        return true;
    } else {
        return false;
    }
}

// Assembly:
subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movq 0x18(%rsp), %r8
movq %r8, 0x8(%rsp)
movq %r8, %rdi
addq $0x30, %rdi
movq %r8, %rsi
addq $0x130, %rsi            # imm = 0x130
movq %r8, %rdx
addq $0x168, %rdx            # imm = 0x168
movq %r8, %rcx
addq $0x180, %rcx            # imm = 0x180
addq $0x198, %r8             # imm = 0x198
leaq 0x17(%rsp), %r9
callq 0x9f00
testb $0x1, %al
jne 0x39922
testb $0x1, 0x17(%rsp)
je 0x3993c
movq 0x8(%rsp), %r8
movq %r8, %rdi
addq $0x30, %rdi
movq %r8, %rsi
addq $0x130, %rsi            # imm = 0x130
movq %r8, %rdx
addq $0x168, %rdx            # imm = 0x168
movq %r8, %rcx
addq $0x180, %rcx            # imm = 0x180
addq $0x198, %r8             # imm = 0x198
callq 0xb480
testb $0x1, %al
jne 0x39922
movq 0x8(%rsp), %r8
movq %r8, %rdi
addq $0x30, %rdi
movq %r8, %rsi
addq $0x130, %rsi            # imm = 0x130
movq %r8, %rdx
addq $0x168, %rdx            # imm = 0x168
movq %r8, %rcx
addq $0x180, %rcx            # imm = 0x180
addq $0x198, %r8             # imm = 0x198
callq 0xe780
testb $0x1, %al
jne 0x39922
jmp 0x3993c
movq 0x8(%rsp), %rax
movl $0x8, 0x8(%rax)
movb $0x1, 0x128(%rax)
movb $0x1, 0x27(%rsp)
jmp 0x39941
movb $0x0, 0x27(%rsp)
movb 0x27(%rsp), %al
andb $0x1, %al
addq $0x28, %rsp
retq
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::print() const
void Alg::print() const {
    cout << searchTree.size();
    cout << "\n";
    return;
    for (uint32_t i = 0 ; i < searchTree.size() ; i++) {
        cout << "Search Node " << i << "\n---\n";
        searchTree[i]->print();
        cout << "\n";
    }
}

// Assembly:
pushq %rax
movq %rdi, (%rsp)
movq (%rsp), %rdi
callq 0x3b170
movq %rax, %rsi
movq 0x24668(%rip), %rdi     # 0x5dfd0
callq 0x2060
movq 0x2465c(%rip), %rdi     # 0x5dfd0
leaq 0xcc39(%rip), %rsi      # 0x465b4
callq 0x2190
popq %rax
retq
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::SearchNode::SearchNode(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, bool const&)
SearchNode(const std::string &inputFile, const bool &checkIndependentSet) : id(NONE), graph(inputFile, checkIndependentSet), reductions(new Reductions(graph, mis)), parent(NONE), leftChild(NONE), rightChild(NONE), finalMis(NULL), hasCut(false), cutIsDone(false) {
            uint32_t maxDegreeNode;
            graph.getMaxNodeDegree(maxDegreeNode, theta);
            if (theta > 8) {
                theta = 8;
            } else if (theta < 3) {
                theta = 3;
            }
        }

// Assembly:
subq $0x78, %rsp
movq %rdi, 0x70(%rsp)
movq %rsi, 0x68(%rsp)
movq %rdx, 0x60(%rsp)
movq 0x70(%rsp), %rdi
movq %rdi, 0x38(%rsp)
movl $0xffffffff, (%rdi)     # imm = 0xFFFFFFFF
addq $0x8, %rdi
movq %rdi, 0x30(%rsp)
callq 0x3a200
movq 0x38(%rsp), %rdi
addq $0x30, %rdi
movq %rdi, 0x40(%rsp)
movq 0x68(%rsp), %rsi
movq 0x60(%rsp), %rdx
callq 0xf180
jmp 0x39de0
movq 0x38(%rsp), %rdi
subq $-0x80, %rdi
movq %rdi, 0x18(%rsp)
callq 0x3a280
movq 0x38(%rsp), %rax
addq $0x108, %rax            # imm = 0x108
movq %rax, 0x20(%rsp)
movl $0x50, %edi
callq 0x21b0
movq %rax, 0x28(%rsp)
jmp 0x39e14
movq 0x28(%rsp), %rdi
movq 0x38(%rsp), %rdx
movq %rdx, %rsi
addq $0x30, %rsi
subq $-0x80, %rdx
callq 0x3a390
jmp 0x39e30
movq 0x38(%rsp), %rdi
movq 0x20(%rsp), %rax
movq 0x28(%rsp), %rcx
movq %rcx, (%rax)
movl $0xffffffff, 0x110(%rdi) # imm = 0xFFFFFFFF
movl $0xffffffff, 0x114(%rdi) # imm = 0xFFFFFFFF
movl $0xffffffff, 0x118(%rdi) # imm = 0xFFFFFFFF
movq $0x0, 0x120(%rdi)
movb $0x0, 0x128(%rdi)
addq $0x130, %rdi            # imm = 0x130
movq %rdi, (%rsp)
callq 0x1a020
movq 0x38(%rsp), %rdi
addq $0x168, %rdi            # imm = 0x168
movq %rdi, 0x8(%rsp)
callq 0x17e60
movq 0x38(%rsp), %rdi
addq $0x180, %rdi            # imm = 0x180
movq %rdi, 0x10(%rsp)
callq 0x17e60
movq 0x38(%rsp), %rdx
movb $0x0, 0x199(%rdx)
movq %rdx, %rdi
addq $0x30, %rdi
addq $0x4, %rdx
movl $0xffffffff, 0x4c(%rsp) # imm = 0xFFFFFFFF
leaq 0x50(%rsp), %rsi
leaq 0x4c(%rsp), %rcx
callq 0x2aa0
jmp 0x39ede
movq 0x38(%rsp), %rax
cmpl $0x8, 0x4(%rax)
jbe 0x39f64
movq 0x38(%rsp), %rax
movl $0x8, 0x4(%rax)
jmp 0x39f7d
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x58(%rsp)
movl %eax, 0x54(%rsp)
jmp 0x39f96
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x58(%rsp)
movl %eax, 0x54(%rsp)
jmp 0x39f82
movq 0x28(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x58(%rsp)
movl %eax, 0x54(%rsp)
callq 0x2180
jmp 0x39f82
movq 0x10(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x58(%rsp)
movl %eax, 0x54(%rsp)
callq 0x18520
movq 0x8(%rsp), %rdi
callq 0x18520
movq (%rsp), %rdi
callq 0x1a030
jmp 0x39f82
movq 0x38(%rsp), %rax
cmpl $0x3, 0x4(%rax)
jae 0x39f7b
movq 0x38(%rsp), %rax
movl $0x3, 0x4(%rax)
jmp 0x39f7d
addq $0x78, %rsp
retq
movq 0x18(%rsp), %rdi
callq 0x3a3e0
movq 0x40(%rsp), %rdi
callq 0x2990
movq 0x30(%rsp), %rdi
callq 0x3a310
movq 0x58(%rsp), %rdi
callq 0x2310
nopw (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::chooseCutBranch(Alg::SearchNode*)
void chooseCutBranch(SearchNode *parent) {
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        if (leftChild->finalMis->size() == rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_1;
        } else { //if (leftChild->finalMis->size() > rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_2;
        }/* else {
            assert(false);
        }*/
        delete rightChild->finalMis;
        delete searchTree.back();
        searchTree.pop_back();
        parent->cutIsDone = true;
    }

// Assembly:
subq $0x58, %rsp
movq %rdi, 0x50(%rsp)
movq %rsi, 0x48(%rsp)
movq 0x50(%rsp), %rdi
movq %rdi, 0x20(%rsp)
movq 0x48(%rsp), %rax
movl 0x114(%rax), %eax
movl %eax, %esi
callq 0x3a420
movq 0x20(%rsp), %rdi
movq (%rax), %rax
movq %rax, 0x40(%rsp)
movq 0x48(%rsp), %rax
movl 0x118(%rax), %eax
movl %eax, %esi
callq 0x3a420
movq 0x20(%rsp), %rdi
movq (%rax), %rax
movq %rax, 0x38(%rsp)
movq 0x48(%rsp), %rax
movl 0x118(%rax), %eax
movq %rax, 0x28(%rsp)
callq 0x3b170
movq 0x28(%rsp), %rcx
movq %rax, %rdx
subq $0x1, %rdx
xorl %eax, %eax
cmpq %rdx, %rcx
movb %al, 0x37(%rsp)
jne 0x3aab2
movq 0x20(%rsp), %rdi
movq 0x48(%rsp), %rax
movl 0x114(%rax), %eax
movq %rax, 0x18(%rsp)
callq 0x3b170
movq %rax, %rcx
movq 0x18(%rsp), %rax
subq $0x2, %rcx
cmpq %rcx, %rax
sete %al
movb %al, 0x37(%rsp)
movb 0x37(%rsp), %al
testb $0x1, %al
jne 0x3aabc
jmp 0x3aabe
jmp 0x3aadd
leaq 0xc0fa(%rip), %rdi      # 0x46bbf
leaq 0xc041(%rip), %rsi      # 0x46b0d
movl $0x15e, %edx            # imm = 0x15E
leaq 0xc141(%rip), %rcx      # 0x46c19
callq 0x2110
movq 0x40(%rsp), %rax
movq 0x120(%rax), %rdi
callq 0x188e0
movq %rax, 0x10(%rsp)
movq 0x38(%rsp), %rax
movq 0x120(%rax), %rdi
callq 0x188e0
movq %rax, %rcx
movq 0x10(%rsp), %rax
cmpq %rcx, %rax
jne 0x3ab1f
movq 0x48(%rsp), %rax
movl $0x9, 0x8(%rax)
jmp 0x3ab2b
movq 0x48(%rsp), %rax
movl $0xa, 0x8(%rax)
movq 0x38(%rsp), %rax
movq 0x120(%rax), %rax
movq %rax, 0x8(%rsp)
cmpq $0x0, %rax
je 0x3ab56
movq 0x8(%rsp), %rdi
callq 0x18520
movq 0x8(%rsp), %rdi
callq 0x2180
movq 0x20(%rsp), %rdi
callq 0x3f310
movq (%rax), %rax
movq %rax, (%rsp)
cmpq $0x0, %rax
je 0x3ab7f
movq (%rsp), %rdi
callq 0x38ed0
movq (%rsp), %rdi
callq 0x2180
movq 0x20(%rsp), %rdi
callq 0x3f350
movq 0x48(%rsp), %rax
movb $0x1, 0x199(%rax)
addq $0x58, %rsp
retq
nopw (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::BranchingRule::getMeasure(Graph const&, unsigned int const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>*)
static uint32_t getMeasure(const Graph &graph, const uint32_t &node, std::unordered_set<uint32_t> *neighborsAtDistance2Ptr = NULL) {
            std::vector<uint32_t> neighbors;
            graph.gatherNeighbors(node, neighbors);
            neighbors.push_back(node);
            std::unordered_set<uint32_t> neighborsAtDistance2;
            if (neighborsAtDistance2Ptr == NULL) {
                graph.getNeighborsAtDistance2(node, neighborsAtDistance2);
                neighborsAtDistance2Ptr = &neighborsAtDistance2;
            }
            uint32_t f = graph.getNumberOfEdgesBetweenSets(neighbors, *neighborsAtDistance2Ptr);
            return 2 * f - neighborsAtDistance2Ptr->size();
        }

// Assembly:
subq $0xa8, %rsp
movq %rdi, 0xa0(%rsp)
movq %rsi, 0x98(%rsp)
movq %rdx, 0x90(%rsp)
leaq 0x78(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x17e60
movq 0x18(%rsp), %rdx
movq 0xa0(%rsp), %rdi
movq 0x98(%rsp), %rsi
movl $0xffffffff, 0x74(%rsp) # imm = 0xFFFFFFFF
xorl %eax, %eax
movl %eax, %ecx
leaq 0x74(%rsp), %r8
callq 0x19c30
jmp 0x3f0db
movq 0x98(%rsp), %rsi
leaq 0x78(%rsp), %rdi
callq 0x19070
jmp 0x3f0ef
leaq 0x28(%rsp), %rdi
callq 0x1a020
cmpq $0x0, 0x90(%rsp)
jne 0x3f16e
movq 0xa0(%rsp), %rdi
movq 0x98(%rsp), %rsi
movl $0xffffffff, 0x24(%rsp) # imm = 0xFFFFFFFF
xorl %eax, %eax
movl %eax, %r8d
leaq 0x28(%rsp), %rdx
leaq 0x24(%rsp), %rcx
callq 0x2f30
jmp 0x3f132
leaq 0x28(%rsp), %rax
movq %rax, 0x90(%rsp)
jmp 0x3f16e
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x68(%rsp)
movl %eax, 0x64(%rsp)
jmp 0x3f1df
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x68(%rsp)
movl %eax, 0x64(%rsp)
leaq 0x28(%rsp), %rdi
callq 0x1a030
jmp 0x3f1df
movq 0xa0(%rsp), %rdi
movq 0x90(%rsp), %rdx
leaq 0x78(%rsp), %rsi
callq 0x3f200
movl %eax, 0x14(%rsp)
jmp 0x3f18e
movl 0x14(%rsp), %eax
movl %eax, 0x20(%rsp)
movl 0x20(%rsp), %eax
shll %eax
movl %eax, %eax
movq %rax, 0x8(%rsp)
movq 0x90(%rsp), %rdi
callq 0x191e0
movq %rax, %rcx
movq 0x8(%rsp), %rax
subq %rcx, %rax
movl %eax, 0x10(%rsp)
leaq 0x28(%rsp), %rdi
callq 0x1a030
leaq 0x78(%rsp), %rdi
callq 0x18520
movl 0x10(%rsp), %eax
addq $0xa8, %rsp
retq
leaq 0x78(%rsp), %rdi
callq 0x18520
movq 0x68(%rsp), %rdi
callq 0x2310
nopw %cs:(%rax,%rax)
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: unsigned int Graph::getNumberOfEdgesBetweenSets<std::vector<unsigned int, std::allocator<unsigned int>>, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>>(std::vector<unsigned int, std::allocator<unsigned int>> const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>> const&) const
uint32_t getNumberOfEdgesBetweenSets(const Container1 &set1, const Container2 &set2) const {
        uint32_t count = 0;
        for (auto i: set1) {
            for (auto j: set2) {
                if (edgeExists(i, j)) {
                    count++;
                }
            }
        }
        return count;
    }

// Assembly:
subq $0x68, %rsp
movq %rdi, 0x60(%rsp)
movq %rsi, 0x58(%rsp)
movq %rdx, 0x50(%rsp)
movq 0x60(%rsp), %rax
movq %rax, (%rsp)
movl $0x0, 0x4c(%rsp)
movq 0x58(%rsp), %rax
movq %rax, 0x40(%rsp)
movq 0x40(%rsp), %rdi
callq 0x193b0
movq %rax, 0x38(%rsp)
movq 0x40(%rsp), %rdi
callq 0x19420
movq %rax, 0x30(%rsp)
leaq 0x38(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x3f264
jmp 0x3f304
leaq 0x38(%rsp), %rdi
callq 0x19450
movl (%rax), %eax
movl %eax, 0x2c(%rsp)
movq 0x50(%rsp), %rax
movq %rax, 0x20(%rsp)
movq 0x20(%rsp), %rdi
callq 0x1b520
movq %rax, 0x18(%rsp)
movq 0x20(%rsp), %rdi
callq 0x1b550
movq %rax, 0x10(%rsp)
leaq 0x18(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x19280
testb $0x1, %al
jne 0x3f2b1
jmp 0x3f2f3
leaq 0x18(%rsp), %rdi
callq 0x1b580
movq (%rsp), %rdi
movl (%rax), %eax
movl %eax, 0xc(%rsp)
leaq 0x2c(%rsp), %rsi
leaq 0xc(%rsp), %rdx
callq 0x18920
testb $0x1, %al
jne 0x3f2da
jmp 0x3f2e5
movl 0x4c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x4c(%rsp)
jmp 0x3f2e7
leaq 0x18(%rsp), %rdi
callq 0x1b5a0
jmp 0x3f29c
jmp 0x3f2f5
leaq 0x38(%rsp), %rdi
callq 0x23ff0
jmp 0x3f24c
movl 0x4c(%rsp), %eax
addq $0x68, %rsp
retq
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::markHypernode(unsigned int const&, std::vector<unsigned int, std::allocator<unsigned int>> const&, std::vector<unsigned int, std::allocator<unsigned int>> const&)
void Mis::markHypernode(const uint32_t &hypernode, const vector<uint32_t> &nodes, const vector<uint32_t> &neighbors) {
    const vector<uint32_t> *container = &nodes;
    for (uint32_t i = 0 ; i < 2 ; i++) {
        for (auto node: *container) {
            auto it = hypernodeToInnernode.find(node);
            if (it != hypernodeToInnernode.end()) {
                it->second.outerLevel = false;
            }
        }
        container = &neighbors;
    }
    assert(hypernodeToInnernode.insert({hypernode, Innernode(nodes, neighbors)}).second);
}

// Assembly:
subq $0x138, %rsp            # imm = 0x138
movq %rdi, 0x130(%rsp)
movq %rsi, 0x128(%rsp)
movq %rdx, 0x120(%rsp)
movq %rcx, 0x118(%rsp)
movq 0x130(%rsp), %rax
movq %rax, 0x28(%rsp)
movq 0x120(%rsp), %rax
movq %rax, 0x110(%rsp)
movl $0x0, 0x10c(%rsp)
cmpl $0x2, 0x10c(%rsp)
jae 0x41135
movq 0x110(%rsp), %rax
movq %rax, 0x100(%rsp)
movq 0x100(%rsp), %rdi
callq 0x193b0
movq %rax, 0xf8(%rsp)
movq 0x100(%rsp), %rdi
callq 0x19420
movq %rax, 0xf0(%rsp)
leaq 0xf8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x41085
jmp 0x4110f
leaq 0xf8(%rsp), %rdi
callq 0x19450
movq 0x28(%rsp), %rdi
movl (%rax), %eax
movl %eax, 0xec(%rsp)
addq $0x18, %rdi
leaq 0xec(%rsp), %rsi
callq 0x42500
movq 0x28(%rsp), %rdi
movq %rax, 0xe0(%rsp)
addq $0x18, %rdi
callq 0x42550
movq %rax, 0xd8(%rsp)
leaq 0xe0(%rsp), %rdi
leaq 0xd8(%rsp), %rsi
callq 0x42530
testb $0x1, %al
jne 0x410ea
jmp 0x410fb
leaq 0xe0(%rsp), %rdi
callq 0x42580
movb $0x0, 0x38(%rax)
jmp 0x410fd
leaq 0xf8(%rsp), %rdi
callq 0x23ff0
jmp 0x41067
movq 0x118(%rsp), %rax
movq %rax, 0x110(%rsp)
movl 0x10c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x10c(%rsp)
jmp 0x4101f
movq 0x28(%rsp), %rax
addq $0x18, %rax
movq %rax, 0x10(%rsp)
movq 0x128(%rsp), %rax
movq %rax, 0x18(%rsp)
movq 0x120(%rsp), %rsi
movq 0x118(%rsp), %rdx
leaq 0x50(%rsp), %rdi
movq %rdi, 0x20(%rsp)
callq 0x425f0
movq 0x18(%rsp), %rsi
movq 0x20(%rsp), %rdx
leaq 0x88(%rsp), %rdi
callq 0x42670
jmp 0x41188
movq 0x10(%rsp), %rdi
leaq 0x88(%rsp), %rsi
callq 0x425a0
movb %dl, 0x7(%rsp)
movq %rax, 0x8(%rsp)
jmp 0x411a5
movb 0x7(%rsp), %al
movq 0x8(%rsp), %rcx
movq %rcx, 0x30(%rsp)
movb %al, 0x38(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0xc8(%rsp)
movb 0x38(%rsp), %al
movb %al, 0xd0(%rsp)
testb $0x1, 0xd0(%rsp)
je 0x411db
jmp 0x41227
leaq 0x5c1a(%rip), %rdi      # 0x46dfc
leaq 0x5c60(%rip), %rsi      # 0x46e49
movl $0x13, %edx
leaq 0x5c60(%rip), %rcx      # 0x46e55
callq 0x2110
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
jmp 0x41246
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
leaq 0x88(%rsp), %rdi
callq 0x3dcb0
jmp 0x41246
leaq 0x88(%rsp), %rdi
callq 0x3dcb0
leaq 0x50(%rsp), %rdi
callq 0x3dcd0
addq $0x138, %rsp            # imm = 0x138
retq
leaq 0x50(%rsp), %rdi
callq 0x3dcd0
movq 0x48(%rsp), %rdi
callq 0x2310
nopw (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::unfoldHypernodes(std::vector<unsigned int, std::allocator<unsigned int>>&, std::vector<unsigned int, std::allocator<unsigned int>>&)
void Mis::unfoldHypernodes(vector<uint32_t> &zeroDegreeNodes, vector<uint32_t> &finalMis) {
    finalMis.reserve(zeroDegreeNodes.size() + mis.size());
    expandIncludedNodes(mis, finalMis);
    expandIncludedNodes(zeroDegreeNodes, finalMis);
    expandExcludedNodes(finalMis);
}

// Assembly:
subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq %rdx, 0x20(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0x18(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
movq 0x28(%rsp), %rdi
callq 0x188e0
movq 0x18(%rsp), %rdi
movq %rax, 0x8(%rsp)
callq 0x188e0
movq 0x8(%rsp), %rsi
movq 0x10(%rsp), %rdi
addq %rax, %rsi
callq 0x18f30
movq 0x18(%rsp), %rsi
movq 0x20(%rsp), %rdx
movq %rsi, %rdi
callq 0x426b0
movq 0x18(%rsp), %rdi
movq 0x28(%rsp), %rsi
movq 0x20(%rsp), %rdx
callq 0x426b0
movq 0x18(%rsp), %rdi
movq 0x20(%rsp), %rsi
callq 0x412f0
addq $0x38, %rsp
retq
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::print(std::vector<unsigned int, std::allocator<unsigned int>>&)
void Mis::print(vector<uint32_t> &finalMis) {
    cout <<"\nWriting Maximum Independent Set to file " << Mis::misOutputFile << endl;
    cout << "Maximum Independent Set size: " << finalMis.size() << "\n";
    FILE *f;
    f = fopen(Mis::misOutputFile.c_str(), "w");
    if (f == NULL) {
        cerr << "Error in opening mis output file " << Mis::misOutputFile << endl;
        exit(EXIT_FAILURE);
    }
    fprintf(f, "Maximum Independent Set size: %ld\n", finalMis.size());
    for (auto node : finalMis) {
        fprintf(f, "%" PRIu32 "\n", node);
    }
    fclose(f);
}

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq 0x1ca10(%rip), %rdi     # 0x5dfd0
leaq 0x58ec(%rip), %rsi      # 0x46eb3
callq 0x2190
movq %rax, %rdi
leaq 0x1cc12(%rip), %rsi     # 0x5e1e8
callq 0x2170
movq %rax, %rdi
movq 0x1c9d3(%rip), %rsi     # 0x5dfb8
callq 0x21d0
movq 0x1c9df(%rip), %rdi     # 0x5dfd0
leaq 0x58e5(%rip), %rsi      # 0x46edd
callq 0x2190
movq %rax, 0x10(%rsp)
movq 0x40(%rsp), %rdi
callq 0x188e0
movq 0x10(%rsp), %rdi
movq %rax, %rsi
callq 0x2060
movq %rax, %rdi
leaq 0x4f91(%rip), %rsi      # 0x465b4
callq 0x2190
leaq 0x1cbb9(%rip), %rdi     # 0x5e1e8
callq 0x20b0
movq %rax, %rdi
leaq 0x58be(%rip), %rsi      # 0x46efc
callq 0x2200
movq %rax, 0x38(%rsp)
cmpq $0x0, 0x38(%rsp)
jne 0x4168b
movq 0x1c999(%rip), %rdi     # 0x5dff0
leaq 0x58a0(%rip), %rsi      # 0x46efe
callq 0x2190
movq %rax, %rdi
leaq 0x1cb7b(%rip), %rsi     # 0x5e1e8
callq 0x2170
movq %rax, %rdi
movq 0x1c93c(%rip), %rsi     # 0x5dfb8
callq 0x21d0
movl $0x1, %edi
callq 0x2210
movq 0x38(%rsp), %rax
movq %rax, 0x8(%rsp)
movq 0x40(%rsp), %rdi
callq 0x188e0
movq 0x8(%rsp), %rdi
movq %rax, %rdx
leaq 0x5872(%rip), %rsi      # 0x46f20
movb $0x0, %al
callq 0x2280
movq 0x40(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
callq 0x19b50
movq %rax, 0x28(%rsp)
movq 0x30(%rsp), %rdi
callq 0x1a0e0
movq %rax, 0x20(%rsp)
leaq 0x28(%rsp), %rdi
leaq 0x20(%rsp), %rsi
callq 0x1a110
testb $0x1, %al
jne 0x416f2
jmp 0x41725
leaq 0x28(%rsp), %rdi
callq 0x1a150
movl (%rax), %eax
movl %eax, 0x1c(%rsp)
movq 0x38(%rsp), %rdi
movl 0x1c(%rsp), %edx
leaq 0x5831(%rip), %rsi      # 0x46f43
movb $0x0, %al
callq 0x2280
leaq 0x28(%rsp), %rdi
callq 0x1a160
jmp 0x416dd
movq 0x38(%rsp), %rdi
callq 0x21a0
addq $0x48, %rsp
retq
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::removeSubsequentNodes(std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>&)
void Mis::removeSubsequentNodes(unordered_set<uint32_t> &nodes) {
    removeHypernodes(nodes);
    unordered_set<uint32_t> toRemove;
    for (auto s: subsequentNodes) {
        if (nodes.find(s.second) == nodes.end()) {
            toRemove.insert(s.first);
        }
    }
    for (auto i: toRemove) {
        subsequentNodes.erase(i);
    }
}

// Assembly:
subq $0xd8, %rsp
movq %rdi, 0xd0(%rsp)
movq %rsi, 0xc8(%rsp)
movq 0xd0(%rsp), %rdi
movq %rdi, 0x18(%rsp)
movq 0xc8(%rsp), %rsi
callq 0x41740
leaq 0x90(%rsp), %rdi
callq 0x1a020
movq 0x18(%rsp), %rax
addq $0x50, %rax
movq %rax, 0x88(%rsp)
movq 0x88(%rsp), %rdi
callq 0x42e60
movq %rax, 0x80(%rsp)
movq 0x88(%rsp), %rdi
callq 0x19370
movq %rax, 0x78(%rsp)
leaq 0x80(%rsp), %rdi
leaq 0x78(%rsp), %rsi
callq 0x42e90
testb $0x1, %al
jne 0x41f81
jmp 0x42045
leaq 0x80(%rsp), %rdi
callq 0x42eb0
movq (%rax), %rax
movq %rax, 0x70(%rsp)
movq 0xc8(%rsp), %rdi
leaq 0x74(%rsp), %rsi
callq 0x192c0
movq %rax, 0x10(%rsp)
jmp 0x41faf
movq 0x10(%rsp), %rax
movq %rax, 0x68(%rsp)
movq 0xc8(%rsp), %rdi
callq 0x19250
movq %rax, 0x50(%rsp)
leaq 0x68(%rsp), %rdi
leaq 0x50(%rsp), %rsi
callq 0x1a690
testb $0x1, %al
jne 0x41fe0
jmp 0x42031
leaq 0x90(%rsp), %rdi
leaq 0x70(%rsp), %rsi
callq 0x18960
movb %dl, 0x7(%rsp)
movq %rax, 0x8(%rsp)
jmp 0x41ffd
movb 0x7(%rsp), %al
movq 0x8(%rsp), %rcx
movq %rcx, 0x40(%rsp)
movb %al, 0x48(%rsp)
jmp 0x42031
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x60(%rsp)
movl %eax, 0x5c(%rsp)
leaq 0x90(%rsp), %rdi
callq 0x1a030
jmp 0x420cd
jmp 0x42033
leaq 0x80(%rsp), %rdi
callq 0x42ed0
jmp 0x41f66
leaq 0x90(%rsp), %rax
movq %rax, 0x38(%rsp)
movq 0x38(%rsp), %rdi
callq 0x19220
movq %rax, 0x30(%rsp)
movq 0x38(%rsp), %rdi
callq 0x19250
movq %rax, 0x28(%rsp)
leaq 0x30(%rsp), %rdi
leaq 0x28(%rsp), %rsi
callq 0x19280
testb $0x1, %al
jne 0x42085
jmp 0x420b8
leaq 0x30(%rsp), %rdi
callq 0x192a0
movq 0x18(%rsp), %rdi
movl (%rax), %eax
movl %eax, 0x24(%rsp)
addq $0x50, %rdi
leaq 0x24(%rsp), %rsi
callq 0x42f00
jmp 0x420aa
jmp 0x420ac
leaq 0x30(%rsp), %rdi
callq 0x192f0
jmp 0x42070
leaq 0x90(%rsp), %rdi
callq 0x1a030
addq $0xd8, %rsp
retq
movq 0x60(%rsp), %rdi
callq 0x2310
nopw (%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/ControlUnit.cpp
// Function: main
int main(int argc, char **argv) {
    string graphInputFile;
    bool checkIndependentSet = false;
    for (int i=1 ; i < argc ; i++) {
        if (!strcmp(argv[i], "-check")) {
            checkIndependentSet = true;
        } else {
            graphInputFile = argv[i];
        }
   }
   if (!graphInputFile.compare("")) {
       cerr << "Error: No graph input file specified" << endl;
       exit(EXIT_FAILURE);
   }
   ControlUnit controlUnit(graphInputFile, checkIndependentSet);
   if (!checkIndependentSet) {
       controlUnit.run();
   } else {
       controlUnit.checkIndependentSet(graphInputFile + ".mis");
   }
}

// Assembly:
subq $0x88, %rsp
movl $0x0, 0x84(%rsp)
movl %edi, 0x80(%rsp)
movq %rsi, 0x78(%rsp)
leaq 0x58(%rsp), %rdi
callq 0x2260
movb $0x0, 0x57(%rsp)
movl $0x1, 0x50(%rsp)
movl 0x50(%rsp), %eax
cmpl 0x80(%rsp), %eax
jge 0x44b46
movq 0x78(%rsp), %rax
movslq 0x50(%rsp), %rcx
movq (%rax,%rcx,8), %rdi
leaq 0x259b(%rip), %rsi      # 0x47092
callq 0x2270
cmpl $0x0, %eax
jne 0x44b08
movb $0x1, 0x57(%rsp)
jmp 0x44b37
movq 0x78(%rsp), %rax
movslq 0x50(%rsp), %rcx
movq (%rax,%rcx,8), %rsi
leaq 0x58(%rsp), %rdi
callq 0x2240
jmp 0x44b22
jmp 0x44b37
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
jmp 0x44c48
jmp 0x44b39
movl 0x50(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x50(%rsp)
jmp 0x44ad5
leaq 0x58(%rsp), %rdi
leaq 0x1a4e(%rip), %rsi      # 0x465a0
callq 0x2080
cmpl $0x0, %eax
jne 0x44b91
movq 0x1948d(%rip), %rdi     # 0x5dff0
leaq 0x252f(%rip), %rsi      # 0x47099
callq 0x2190
movq %rax, (%rsp)
jmp 0x44b75
movq (%rsp), %rdi
movq 0x19438(%rip), %rsi     # 0x5dfb8
callq 0x21d0
jmp 0x44b87
movl $0x1, %edi
callq 0x2210
leaq 0x28(%rsp), %rdi
leaq 0x58(%rsp), %rsi
leaq 0x57(%rsp), %rdx
callq 0x451a0
jmp 0x44ba7
testb $0x1, 0x57(%rsp)
jne 0x44bcc
leaq 0x28(%rsp), %rdi
callq 0x44c60
jmp 0x44bba
jmp 0x44c1b
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
jmp 0x44c3e
leaq 0x1e89(%rip), %rdx      # 0x46a5c
leaq 0x8(%rsp), %rdi
leaq 0x58(%rsp), %rsi
callq 0x39fd0
jmp 0x44be4
leaq 0x28(%rsp), %rdi
leaq 0x8(%rsp), %rsi
callq 0x44c70
jmp 0x44bf5
leaq 0x8(%rsp), %rdi
callq 0x2368
jmp 0x44c1b
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
leaq 0x8(%rsp), %rdi
callq 0x2368
jmp 0x44c3e
leaq 0x28(%rsp), %rdi
callq 0x451d0
leaq 0x58(%rsp), %rdi
callq 0x2368
movl 0x84(%rsp), %eax
addq $0x88, %rsp
retq
leaq 0x28(%rsp), %rdi
callq 0x451d0
leaq 0x58(%rsp), %rdi
callq 0x2368
movq 0x48(%rsp), %rdi
callq 0x2310
nopl (%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Util.cpp
// Function: isSubsetOf(std::vector<unsigned int, std::allocator<unsigned int>> const&, __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>&, __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>&)
bool isSubsetOf(const vector<uint32_t> &container1, vector<uint32_t>::iterator &begin, vector<uint32_t>::iterator &end) {
    for (auto &i: container1) {
        if (!binary_search(begin, end, i)) {
            return false;
        }
    }
    return true;
}

// Assembly:
subq $0x58, %rsp
movq %rdi, 0x48(%rsp)
movq %rsi, 0x40(%rsp)
movq %rdx, 0x38(%rsp)
movq 0x48(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
callq 0x193b0
movq %rax, 0x28(%rsp)
movq 0x30(%rsp), %rdi
callq 0x19420
movq %rax, 0x20(%rsp)
leaq 0x28(%rsp), %rdi
leaq 0x20(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x45270
jmp 0x452c6
leaq 0x28(%rsp), %rdi
callq 0x19450
movq %rax, 0x18(%rsp)
movq 0x40(%rsp), %rax
movq (%rax), %rax
movq %rax, 0x10(%rsp)
movq 0x38(%rsp), %rax
movq (%rax), %rax
movq %rax, 0x8(%rsp)
movq 0x18(%rsp), %rdx
movq 0x10(%rsp), %rdi
movq 0x8(%rsp), %rsi
callq 0x45490
testb $0x1, %al
jne 0x452b8
movb $0x0, 0x57(%rsp)
jmp 0x452cb
jmp 0x452ba
leaq 0x28(%rsp), %rdi
callq 0x23ff0
jmp 0x4525b
movb $0x1, 0x57(%rsp)
movb 0x57(%rsp), %al
andb $0x1, %al
addq $0x58, %rsp
retq
nopw %cs:(%rax,%rax)
// File: iPapatsoris[P]Maximum-Independent-Set/src/Util.cpp
// Function: setsHaveKUncommonElements(std::vector<unsigned int, std::allocator<unsigned int>> const&, std::vector<unsigned int, std::allocator<unsigned int>> const&, unsigned int const&, unsigned int&)
bool setsHaveKUncommonElements(const vector<uint32_t> &container1, const vector<uint32_t> &container2, const uint32_t &k, uint32_t &uncommonElement) {
    uint32_t uncommonElements = 0;
    const vector<uint32_t> *containerPtr = &container1;
    auto begin = container2.begin();
    auto end = container2.end();
    for (uint32_t it = 0 ; it < 2 ; it++) {
        for (auto &i: *containerPtr) {
            if (!binary_search(begin, end, i)) {
                uncommonElements++;
                uncommonElement = i;
                if (uncommonElements > k) {
                    return false;
                }
            }
        }
        containerPtr = &container2;
        begin = container1.begin();
        end = container1.end();
    }
    return (uncommonElements == k);
}

// Assembly:
subq $0x98, %rsp
movq %rdi, 0x88(%rsp)
movq %rsi, 0x80(%rsp)
movq %rdx, 0x78(%rsp)
movq %rcx, 0x70(%rsp)
movl $0x0, 0x6c(%rsp)
movq 0x88(%rsp), %rax
movq %rax, 0x60(%rsp)
movq 0x80(%rsp), %rdi
callq 0x193b0
movq %rax, 0x58(%rsp)
movq 0x80(%rsp), %rdi
callq 0x19420
movq %rax, 0x50(%rsp)
movl $0x0, 0x4c(%rsp)
cmpl $0x2, 0x4c(%rsp)
jae 0x4545d
movq 0x60(%rsp), %rax
movq %rax, 0x40(%rsp)
movq 0x40(%rsp), %rdi
callq 0x193b0
movq %rax, 0x38(%rsp)
movq 0x40(%rsp), %rdi
callq 0x19420
movq %rax, 0x30(%rsp)
leaq 0x38(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x193e0
testb $0x1, %al
jne 0x4538a
jmp 0x45408
leaq 0x38(%rsp), %rdi
callq 0x19450
movq %rax, 0x28(%rsp)
movq 0x58(%rsp), %rax
movq %rax, 0x20(%rsp)
movq 0x50(%rsp), %rax
movq %rax, 0x18(%rsp)
movq 0x28(%rsp), %rdx
movq 0x20(%rsp), %rdi
movq 0x18(%rsp), %rsi
callq 0x45530
testb $0x1, %al
jne 0x453f7
movl 0x6c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x6c(%rsp)
movq 0x28(%rsp), %rax
movl (%rax), %ecx
movq 0x70(%rsp), %rax
movl %ecx, (%rax)
movl 0x6c(%rsp), %eax
movq 0x78(%rsp), %rcx
cmpl (%rcx), %eax
jbe 0x453f5
movb $0x0, 0x97(%rsp)
jmp 0x45474
jmp 0x453f7
jmp 0x453f9
leaq 0x38(%rsp), %rdi
callq 0x23ff0
jmp 0x45375
movq 0x80(%rsp), %rax
movq %rax, 0x60(%rsp)
movq 0x88(%rsp), %rdi
callq 0x193b0
movq %rax, 0x10(%rsp)
movq 0x10(%rsp), %rax
movq %rax, 0x58(%rsp)
movq 0x88(%rsp), %rdi
callq 0x19420
movq %rax, 0x8(%rsp)
movq 0x8(%rsp), %rax
movq %rax, 0x50(%rsp)
movl 0x4c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x4c(%rsp)
jmp 0x45342
movl 0x6c(%rsp), %eax
movq 0x78(%rsp), %rcx
cmpl (%rcx), %eax
sete %al
andb $0x1, %al
movb %al, 0x97(%rsp)
movb 0x97(%rsp), %al
andb $0x1, %al
addq $0x98, %rsp
retq
nopw %cs:(%rax,%rax)
nop