JLearn Html Log ([dj., 17 oct. 2013 13:59:45])
[INFO][dj., 17 oct. 2013 13:59:45][rmm.cache.rmmCache] |SIGMA|=1
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks]
RAPacks initialized
Initial D:
[()[ access(p1) ] {{1,},}]
Adding new suffixes
Closing Table
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding [ ] {} to short prefixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1) ] {{1,},} to table
Closing Table
Checking variable consistency
[INFO][dj., 17 oct. 2013 13:59:45][rmm.cache.rmmCache] Queries up to this point: 2
[INFO][dj., 17 oct. 2013 13:59:45][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1) ] {{1,},} | () |
[ access(p1) ] {{1,},} -> miss()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:45][rmm.cache.rmmCache] hypothetical states: 1
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) ] : [miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() ] ()
[INFO][dj., 17 oct. 2013 13:59:45][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) ]
output: [miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() ]
hypout: [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) , miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new suffix (a1->2)[ access(p1)access(p2) ] {{1,},{2,},}
Adding new suffixes
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding (a1->2)[ access(p1)access(p2) ] {{1,},{2,},} to global suffix set
Closing Table
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.Component]
Splitting Component
Old accesss sequence: [ ] {}
New access sequences: [ access(p1) ] {{1,},}
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding [ access(p1) ] {{1,},} to short prefixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2) ] {{1,},{2,},} to table
Closing Table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) , miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new suffix (a1->1)[ access(p1) ] {{1,},}
Adding new suffixes
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding (a1->1)[ access(p1) ] {{1,},} to global suffix set
Closing Table
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.Component]
Splitting Component
Old accesss sequence: [ access(p1) ] {{1,},}
New access sequences: [ access(p1)access(p2) ] {{1,},{2,},}
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding [ access(p1)access(p2) ] {{1,},{2,},} to short prefixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} to table
Closing Table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) , miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},}, wich was ill represented by [ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:45][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) , miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(3) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache] Queries up to this point: 20
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache] hypothetical states: 3
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:46][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(0) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(0) ]
output: [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() ]
hypout: [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(0) , miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},}, wich was ill represented by [ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(0) , miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:46][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(0) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache] Queries up to this point: 36
[INFO][dj., 17 oct. 2013 13:59:46][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache] hypothetical states: 3
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(1) ] : [miss() hit() miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() ] ()
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(1) ]
output: [miss() hit() miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() ]
hypout: [miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(1) , miss() hit()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2), p1=p2 ] {{1,2,},}, wich was ill represented by [ access(p1)access(p2) ] {{1,},{2,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2), p1=p2 ] {{1,2,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(1) , miss() hit()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(1) access(p1)(1) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache] Queries up to this point: 40
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache] hypothetical states: 3
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(2) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(4) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(4) ] : [miss() miss() miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(1) ] : [miss() hit() miss() hit() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(1) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(4) ] : [miss() miss() hit() hit() hit() miss() hit() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(2) ] : [miss() hit() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() hit() hit() miss() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(0) ] : [miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss() hit() miss() ] ()
[INFO][dj., 17 oct. 2013 13:59:47][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(0) ]
output: [miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss() hit() miss() ]
hypout: [miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() hit() hit() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) , miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new suffix (a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},}
Adding new suffixes
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding (a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} to global suffix set
Closing Table
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.Component]
Splitting Component
Old accesss sequence: [ access(p1)access(p2) ] {{1,},{2,},}
New access sequences: [ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},}
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.Component]
Splitting Component
Old accesss sequence: [ access(p1)access(p2) ] {{1,},{2,},}
New access sequences: [ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},}
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding [ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} to short prefixes
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding [ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} to short prefixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} to table
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} to table
Closing Table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) , miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit() hit() hit() miss() miss() miss() miss() miss() miss() miss() hit()
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},}, wich was ill represented by [ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:47][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) , miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit() hit() hit() miss() miss() hit() miss() hit() miss() miss() miss()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(2) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache] Queries up to this point: 84
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
(a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} | (2->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache] hypothetical states: 5
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(2) access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(6) ] : [miss() hit() hit() hit() miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(1) ] : [miss() miss() hit() miss() hit() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(3) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() miss() ] ()
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(0) ]
output: [miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() miss() ]
hypout: [miss() miss() miss() miss() hit() miss() hit() miss() miss() miss() hit() miss() miss() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) , miss() miss() miss() miss() hit() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss() hit() miss() hit() miss()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},}, wich was ill represented by [ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) , miss() miss() miss() miss() hit() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss() hit() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:48][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache] Queries up to this point: 99
[INFO][dj., 17 oct. 2013 13:59:48][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
(a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} | (2->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache] hypothetical states: 5
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(0) ] : [miss() miss() hit() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() hit() ] ()
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) ]
output: [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() hit() ]
hypout: [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) , miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() miss()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3)access(p4), p2=p3=p4 ] {{1,},{2,3,4,},}, wich was ill represented by [ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4), p2=p3=p4 ] {{1,},{2,3,4,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) , miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() hit() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache] Queries up to this point: 115
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
(a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} | (2->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3=p4 ] {{1,},{2,3,4,},} | (1->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-3=p1 ] {{-3,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache] hypothetical states: 5
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(5) ] : [miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(0) ] : [miss() hit() hit() miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() miss() ] ()
[INFO][dj., 17 oct. 2013 13:59:49][rmm.cache.rmmCache]
Counterexample ()
input: [access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(0) ]
output: [miss() hit() hit() miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() miss() ]
hypout: [miss() hit() hit() miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() ]
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(5) , miss() hit() hit() miss() miss() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit() hit() miss() miss() miss() hit() miss()
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] found new prefix [ access(p1)access(p2)access(p3)access(p4), p2=p3 && p1=p4 ] {{1,4,},{2,3,},}, wich was ill represented by [ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},}
Adding new suffixes
Closing Table
[DEBUG][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Adding new word [ access(p1)access(p2)access(p3)access(p4), p2=p3 && p1=p4 ] {{1,4,},{2,3,},} to table
Checking variable consistency
Processing counterxample
[INFO][dj., 17 oct. 2013 13:59:49][de.ls5.learnlib.algorithms.ra.dl.RAPacks] CE: access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(5) , miss() hit() hit() miss() miss() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:50][de.ls5.learnlib.algorithms.ra.dl.RAPacks] Testout : miss() hit() hit() miss() miss() miss() hit() hit()
[INFO][dj., 17 oct. 2013 13:59:50][de.ls5.learnlib.algorithms.ra.dl.RAPacks] access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(5) is not a counterexample
[INFO][dj., 17 oct. 2013 13:59:50][rmm.cache.rmmCache] Queries up to this point: 125
[INFO][dj., 17 oct. 2013 13:59:50][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
(a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 && p1=p4 ] {{1,4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} | (2->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3=p4 ] {{1,},{2,3,4,},} | (1->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-3=p1 ] {{-3,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:50][rmm.cache.rmmCache] hypothetical states: 5
Equivalence Query
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(1) ] : [miss() miss() hit() miss() miss() miss() hit() miss() hit() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(0) ] : [miss() hit() hit() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(2) ] : [miss() miss() miss() hit() miss() hit() hit() hit() hit() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(2) access(p1)(1) ] : [miss() miss() miss() hit() miss() miss() miss() hit() hit() miss() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(0) ] : [miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(1) ] : [miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(4) ] : [miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(6) ] : [miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(5) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(4) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(5) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(4) access(p1)(1) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(1) ] : [miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(1) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(5) ] : [miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(6) ] : [miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(2) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(1) ] : [miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(1) ] : [miss() miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(6) ] : [miss() miss() hit() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(5) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(1) ] : [miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(0) ] : [miss() hit() hit() miss() miss() hit() hit() hit() hit() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(4) ] : [miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(4) ] : [miss() hit() miss() hit() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(3) ] : [miss() hit() miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(4) access(p1)(1) access(p1)(1) ] : [miss() miss() miss() miss() hit() hit() miss() hit() miss() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(6) ] : [miss() hit() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(1) access(p1)(0) ] : [miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(1) ] : [miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(5) ] : [miss() miss() miss() hit() hit() hit() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(0) ] : [miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(4) access(p1)(3) ] : [miss() miss() miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(4) ] : [miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() hit() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(0) ] : [miss() miss() miss() miss() miss() hit() hit() miss() hit() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(6) access(p1)(2) ] : [miss() hit() miss() miss() miss() miss() miss() miss() hit() hit() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(4) ] : [miss() hit() miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(6) ] : [miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(1) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(4) ] : [miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(5) access(p1)(0) ] : [miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(2) ] : [miss() hit() miss() miss() miss() hit() hit() hit() hit() hit() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(3) ] : [miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(0) ] : [miss() miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(2) ] : [miss() miss() hit() miss() hit() miss() hit() miss() miss() hit() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(5) ] : [miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(4) ] : [miss() miss() miss() hit() miss() miss() miss() hit() miss() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(4) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(4) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(3) ] : [miss() miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(6) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(5) ] : [miss() miss() hit() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(1) ] : [miss() hit() miss() miss() miss() hit() miss() hit() hit() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() miss() miss() hit() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(3) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(1) ] : [miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(3) access(p1)(2) ] : [miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(6) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(5) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(4) ] : [miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(4) ] : [miss() miss() miss() hit() hit() miss() hit() hit() miss() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(6) ] : [miss() miss() hit() miss() hit() miss() miss() miss() hit() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(6) access(p1)(2) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(3) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(3) ] : [miss() hit() miss() miss() miss() miss() hit() miss() miss() hit() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(2) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(5) ] : [miss() miss() miss() hit() miss() hit() miss() miss() hit() hit() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() hit() miss() hit() miss() miss() hit() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(1) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(2) ] : [miss() miss() hit() miss() hit() hit() hit() hit() miss() hit() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(1) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(6) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(0) access(p1)(6) ] : [miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) ] : [miss() miss() miss() hit() hit() hit() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() hit() hit() miss() miss() miss() hit() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(3) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(1) ] : [miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) ] : [miss() miss() hit() hit() hit() miss() hit() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(4) ] : [miss() miss() hit() miss() miss() miss() hit() hit() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(5) ] : [miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(3) ] : [miss() miss() miss() hit() miss() hit() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(4) access(p1)(1) ] : [miss() miss() miss() hit() hit() hit() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(1) ] : [miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(2) ] : [miss() hit() miss() hit() miss() miss() hit() miss() miss() hit() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(3) ] : [miss() hit() miss() miss() hit() hit() miss() hit() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(0) ] : [miss() miss() hit() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(6) ] : [miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(5) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() hit() miss() hit() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(6) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(2) ] : [miss() miss() hit() miss() hit() miss() hit() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(0) ] : [miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(1) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(1) ] : [miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(5) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(5) ] : [miss() hit() miss() miss() hit() hit() miss() miss() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(6) access(p1)(3) ] : [miss() hit() hit() miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(5) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(4) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(3) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(5) ] : [miss() miss() miss() hit() miss() miss() miss() miss() hit() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(0) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() hit() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(6) access(p1)(2) access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(6) access(p1)(1) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(2) ] : [miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(4) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() hit() miss() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(6) access(p1)(4) access(p1)(2) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(0) ] : [miss() miss() hit() hit() hit() miss() miss() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(4) ] : [miss() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(4) ] : [miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(6) ] : [miss() miss() miss() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(6) ] : [miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() hit() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(0) access(p1)(4) ] : [miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(6) access(p1)(4) ] : [miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(5) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(4) ] : [miss() miss() miss() miss() miss() miss() hit() hit() hit() miss() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(6) access(p1)(2) ] : [miss() miss() hit() miss() miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(2) access(p1)(5) access(p1)(0) access(p1)(6) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(6) ] : [miss() hit() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(1) ] : [miss() miss() miss() hit() miss() miss() hit() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(6) access(p1)(3) access(p1)(6) ] : [miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(5) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(0) access(p1)(5) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(0) access(p1)(3) ] : [miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(1) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() hit() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(5) ] : [miss() miss() miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(4) ] : [miss() miss() hit() miss() hit() miss() hit() miss() hit() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(0) ] : [miss() miss() hit() miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() hit() hit() hit() hit() miss() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(1) ] : [miss() miss() hit() miss() miss() hit() miss() miss() hit() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(1) ] : [miss() miss() hit() miss() miss() hit() hit() hit() hit() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(6) access(p1)(5) ] : [miss() miss() miss() miss() hit() miss() miss() miss() hit() hit() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(6) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(4) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() hit() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(6) access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(5) access(p1)(1) ] : [miss() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(4) access(p1)(1) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(6) ] : [miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() hit() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(6) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(5) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(3) access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(5) ] : [miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() hit() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(0) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(2) access(p1)(6) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(5) access(p1)(4) ] : [miss() miss() hit() miss() miss() hit() miss() hit() miss() hit() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(6) ] : [miss() miss() hit() miss() hit() miss() hit() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(0) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(2) access(p1)(3) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(0) access(p1)(6) ] : [miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(2) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(0) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(5) access(p1)(6) access(p1)(5) ] : [miss() miss() hit() miss() miss() miss() hit() miss() miss() hit() hit() hit() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(4) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(0) ] : [miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(3) ] : [miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(6) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(1) access(p1)(4) ] : [miss() miss() miss() miss() hit() hit() miss() miss() miss() hit() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(6) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(4) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(1) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(3) access(p1)(0) ] : [miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(4) ] : [miss() miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(6) access(p1)(0) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(4) ] : [miss() miss() miss() miss() miss() hit() hit() miss() hit() miss() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(4) ] : [miss() miss() hit() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(5) access(p1)(1) access(p1)(0) ] : [miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(0) access(p1)(3) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(3) access(p1)(4) access(p1)(0) access(p1)(1) ] : [miss() miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(2) access(p1)(5) access(p1)(0) access(p1)(0) access(p1)(4) access(p1)(0) access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(6) ] : [miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(1) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(0) ] : [miss() hit() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(0) access(p1)(4) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(0) ] : [miss() hit() miss() miss() hit() miss() hit() miss() hit() miss() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(4) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() hit() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(2) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(3) access(p1)(4) access(p1)(3) access(p1)(5) access(p1)(0) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(1) ] : [miss() miss() hit() hit() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(2) access(p1)(3) access(p1)(5) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(2) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(4) access(p1)(4) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(3) ] : [miss() hit() miss() hit() miss() miss() miss() hit() hit() miss() hit() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(3) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(6) access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(2) ] : [miss() hit() miss() miss() miss() miss() hit() miss() hit() hit() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(6) access(p1)(1) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(6) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(4) ] : [miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(6) access(p1)(1) access(p1)(6) access(p1)(5) access(p1)(2) access(p1)(1) access(p1)(6) access(p1)(6) access(p1)(5) access(p1)(3) ] : [miss() miss() miss() miss() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(4) access(p1)(5) access(p1)(4) access(p1)(5) access(p1)(1) access(p1)(4) access(p1)(6) access(p1)(3) access(p1)(5) access(p1)(6) ] : [miss() miss() miss() miss() hit() hit() hit() hit() miss() hit() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(5) access(p1)(5) access(p1)(5) access(p1)(1) access(p1)(2) access(p1)(4) access(p1)(1) access(p1)(1) access(p1)(3) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(5) access(p1)(5) ] : [miss() hit() hit() miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(1) access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(5) access(p1)(6) access(p1)(5) access(p1)(4) access(p1)(2) access(p1)(5) ] : [miss() miss() hit() miss() miss() hit() miss() miss() miss() miss() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(1) access(p1)(3) access(p1)(1) access(p1)(1) access(p1)(0) access(p1)(3) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(1) access(p1)(3) access(p1)(0) access(p1)(4) access(p1)(6) access(p1)(0) access(p1)(5) access(p1)(3) access(p1)(1) access(p1)(0) access(p1)(2) access(p1)(1) access(p1)(2) access(p1)(2) ] : [miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() miss() hit() hit() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(0) access(p1)(3) access(p1)(2) access(p1)(2) access(p1)(4) access(p1)(2) access(p1)(5) access(p1)(4) access(p1)(0) access(p1)(1) access(p1)(2) access(p1)(0) access(p1)(0) access(p1)(3) ] : [miss() miss() miss() hit() miss() hit() miss() miss() miss() miss() miss() miss() hit() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(6) access(p1)(4) access(p1)(0) access(p1)(2) access(p1)(0) access(p1)(5) access(p1)(4) access(p1)(3) access(p1)(0) access(p1)(2) access(p1)(6) access(p1)(3) access(p1)(2) access(p1)(5) ] : [miss() miss() miss() miss() hit() miss() miss() miss() miss() miss() miss() miss() miss() miss() ] ()
[DEBUG][dj., 17 oct. 2013 13:59:50][de.ls5.jlearn.equivalenceoracles.RandomWalkEquivalenceOracle][access(p1)(4) access(p1)(6) access(p1)(6) access(p1)(4) access(p1)(4) access(p1)(2) access(p1)(3) access(p1)(3) access(p1)(2) access(p1)(4) access(p1)(5) access(p1)(3) access(p1)(4) access(p1)(6) ] : [miss() miss() hit() hit() hit() miss() miss() hit() hit() miss() miss() miss() miss() miss() ] ()
Final report
[INFO][dj., 17 oct. 2013 13:59:50][rmm.cache.rmmCache]
Data Structure (plain text)
Prefix | Remapping | ()[ access(p1) ] {{1,},} |
(a1->2)[ access(p1)access(p2) ] {{1,},{2,},} |
(a1->1)[ access(p1) ] {{1,},} |
(a1->1)[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} |
[ ] {} | () |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1) ] {{1,},} | (1->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2), p1=p2 ] {{1,2,},} | (2->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2) ] {{1,},{2,},} | (1->1,2->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4) ] {{1,},{2,},{3,},{4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 ] {{1,},{4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p4 ] {{1,},{3,},{2,4,},} | (3->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3 && p1=p4 ] {{1,4,},{2,3,},} | (3->2,4->1) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p-1=p2 ] {{-1,2,},{1,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p-1=p1 && p2=p3 && p4=p6 ] {{-1,1,},{2,3,},{5,},{4,6,},} -> hit()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> miss()
|
|
[ access(p1)access(p2)access(p3) ] {{1,},{2,},{3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3), p1=p3 ] {{2,},{1,3,},} | (2->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-1=p1 ] {{-1,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p3=p4 ] {{1,},{2,},{3,4,},} | (2->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p0=p1 && p2=p3 && p4=p6 ] {{0,1,},{2,3,},{5,},{4,6,},} -> miss()
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
[ access(p1)access(p2)access(p3), p2=p3 ] {{1,},{2,3,},} | (1->1,3->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-2=p1 ] {{-2,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4), p2=p3=p4 ] {{1,},{2,3,4,},} | (1->1,4->2) |
[ access(p1) ] {{1,},} -> miss()
|
[ access(p1)access(p2), p0=p2 ] {{1,},{0,2,},} -> hit()
[ access(p1)access(p2) ] {{1,},{2,},} -> miss()
|
[ access(p1), p0=p1 ] {{0,1,},} -> hit()
[ access(p1) ] {{1,},} -> miss()
[ access(p1), p-3=p1 ] {{-3,1,},} -> hit()
|
[ access(p1)access(p2)access(p3)access(p4)access(p5)access(p6), p2=p3 && p4=p6 ] {{1,},{2,3,},{5,},{4,6,},} -> hit()
|
|
Hypothesis ()
[INFO][dj., 17 oct. 2013 13:59:51][rmm.cache.rmmCache] hypothetical states: 5
[INFO][dj., 17 oct. 2013 13:59:51][rmm.cache.rmmCache] Queries: 125
[INFO][dj., 17 oct. 2013 13:59:51][rmm.cache.rmmCache] Equivalence queries: 8