comparison src/main/gov/nasa/jpf/search/RandomSearch.java @ 0:61d41facf527

initial v8 import (history reset)
author Peter Mehlitz <Peter.C.Mehlitz@nasa.gov>
date Fri, 23 Jan 2015 10:14:01 -0800
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:61d41facf527
1 /*
2 * Copyright (C) 2014, United States Government, as represented by the
3 * Administrator of the National Aeronautics and Space Administration.
4 * All rights reserved.
5 *
6 * The Java Pathfinder core (jpf-core) platform is licensed under the
7 * Apache License, Version 2.0 (the "License"); you may not use this file except
8 * in compliance with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0.
11 *
12 * Unless required by applicable law or agreed to in writing, software
13 * distributed under the License is distributed on an "AS IS" BASIS,
14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 * See the License for the specific language governing permissions and
16 * limitations under the License.
17 */
18 package gov.nasa.jpf.search;
19
20
21 import gov.nasa.jpf.Config;
22 import gov.nasa.jpf.vm.VM;
23 import gov.nasa.jpf.vm.RestorableVMState;
24
25
26 /**
27 * this is a straight execution pseudo-search - it doesn't search at
28 * all (i.e. it doesn't backtrack), but just behaves like a 'normal' VM,
29 * going forward() until there is no next state then it restarts the search
30 * until it hits a certain number of paths executed
31 *
32 * <2do> this needs to be updated & tested
33 */
34 public class RandomSearch extends Search {
35 int path_limit = 0;
36
37 public RandomSearch (Config config, VM vm) {
38 super(config, vm);
39
40 path_limit = config.getInt("search.RandomSearch.path_limit", 0);
41 }
42
43 @Override
44 public void search () {
45 int depth = 0;
46 int paths = 0;
47 depth++;
48
49 if (hasPropertyTermination()) {
50 return;
51 }
52
53 //vm.forward();
54 RestorableVMState init_state = vm.getRestorableState();
55
56 notifySearchStarted();
57 while (!done) {
58 if ((depth < depthLimit) && forward()) {
59 notifyStateAdvanced();
60
61 if (currentError != null){
62 notifyPropertyViolated();
63
64 if (hasPropertyTermination()) {
65 return;
66 }
67 }
68
69 if (isEndState()){
70 return;
71 }
72
73 depth++;
74
75 } else { // no next state or reached depth limit
76 // <2do> we could check for more things here. If the last insn wasn't
77 // the main return, or a System.exit() call, we could flag a JPFException
78 if (depth >= depthLimit) {
79 notifySearchConstraintHit("depth limit reached: " + depthLimit);
80 }
81 checkPropertyViolation();
82 done = (paths >= path_limit);
83 paths++;
84 System.out.println("paths = " + paths);
85 depth = 1;
86 vm.restoreState(init_state);
87 vm.resetNextCG();
88 }
89 }
90 notifySearchFinished();
91 }
92 }