==676== Memcheck, a memory error detector.
==676== Copyright (C) 2002-2006, and GNU GPL'd, by Julian Seward et al.
==676== Using LibVEX rev 1606, a library for dynamic binary translation.
==676== Copyright (C) 2004-2006, and GNU GPL'd, by OpenWorks LLP.
==676== Using valgrind-3.2.0-Debian, a dynamic binary instrumentation framework.
==676== Copyright (C) 2000-2006, and GNU GPL'd, by Julian Seward et al.
==676== For more details, rerun with: -v
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400A61C: (within /lib/ld-2.5.so)
==676==    by 0x40041A7: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400A2A8: (within /lib/ld-2.5.so)
==676==    by 0x40041A7: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400AA24: (within /lib/ld-2.5.so)
==676==    by 0x40041A7: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400A16B: (within /lib/ld-2.5.so)
==676==    by 0x4003BE9: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400A173: (within /lib/ld-2.5.so)
==676==    by 0x4003BE9: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Conditional jump or move depends on uninitialised value(s)
==676==    at 0x400A2A8: (within /lib/ld-2.5.so)
==676==    by 0x4003BE9: (within /lib/ld-2.5.so)
==676==    by 0x4012E3A: (within /lib/ld-2.5.so)
==676==    by 0x4000C3F: (within /lib/ld-2.5.so)
==676==    by 0x4000816: (within /lib/ld-2.5.so)
==676== 
==676== Invalid read of size 4
==676==    at 0x804AAEF: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::find(ProxTrie* const&) (stl_tree.h:466)
==676==    by 0x804963C: ProxTrie::UnRelate(ProxTrie*) (stl_map.h:534)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x42F3524 is 44 bytes inside a block of size 60 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804A5AD: ProxTrie::~ProxTrie() (ProxTrie.cpp:60)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x804AAFF: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::find(ProxTrie* const&) (stl_tree.h:1317)
==676==    by 0x804963C: ProxTrie::UnRelate(ProxTrie*) (stl_map.h:534)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4454238 is 16 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x804AB06: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::find(ProxTrie* const&) (stl_tree.h:493)
==676==    by 0x804963C: ProxTrie::UnRelate(ProxTrie*) (stl_map.h:534)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4454230 is 8 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x804AB1C: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::find(ProxTrie* const&) (stl_tree.h:1325)
==676==    by 0x804963C: ProxTrie::UnRelate(ProxTrie*) (stl_map.h:534)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4451DD0 is 16 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x8049652: ProxTrie::UnRelate(ProxTrie*) (ProxTrie.cpp:66)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4451DD4 is 20 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid write of size 1
==676==    at 0x804B3D1: Relationship::Valid(bool) (Relationship.cpp:11)
==676==    by 0x804965C: ProxTrie::UnRelate(ProxTrie*) (ProxTrie.cpp:66)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4451D8C is 4 bytes inside a block of size 8 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804A3E1: ProxTrie::~ProxTrie() (ProxTrie.cpp:57)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x804AB0B: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::find(ProxTrie* const&) (stl_tree.h:501)
==676==    by 0x804963C: ProxTrie::UnRelate(ProxTrie*) (stl_map.h:534)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x4CDA834 is 12 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== Invalid read of size 4
==676==    at 0x8049652: ProxTrie::UnRelate(ProxTrie*) (ProxTrie.cpp:66)
==676==    by 0x804A3F3: ProxTrie::~ProxTrie() (ProxTrie.cpp:58)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676==  Address 0x444851C is 20 bytes inside a block of size 24 free'd
==676==    at 0x4020CC7: operator delete(void*) (vg_replace_malloc.c:244)
==676==    by 0x804AB92: std::_Rb_tree<ProxTrie*, std::pair<ProxTrie* const, Relationship*>, std::_Select1st<std::pair<ProxTrie* const, Relationship*> >, std::less<ProxTrie*>, std::allocator<std::pair<ProxTrie* const, Relationship*> > >::_M_erase(std::_Rb_tree_node<std::pair<ProxTrie* const, Relationship*> >*) (new_allocator.h:94)
==676==    by 0x804A433: ProxTrie::~ProxTrie() (stl_tree.h:578)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804A54F: ProxTrie::~ProxTrie() (Trie.hpp:29)
==676==    by 0x804C506: main (main.cpp:14)
==676== 
==676== ERROR SUMMARY: 131107 errors from 14 contexts (suppressed: 0 from 0)
==676== malloc/free: in use at exit: 0 bytes in 0 blocks.
==676== malloc/free: 570,829 allocs, 570,829 frees, 9,871,625 bytes allocated.
==676== For counts of detected errors, rerun with: -v
==676== All heap blocks were freed -- no leaks are possible.