Fix lit test suite when running Boogie under a path that contains

spaces.

7 files changed, 14 insertions, 14 deletions

diff --git a/Test/textbook/BQueue.bpl b/Test/textbook/BQueue.bpl
index 1c52a0e8..f224334c 100644
--- a/Test/textbook/BQueue.bpl
+++ b/Test/textbook/BQueue.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // BQueue.bpl

 // A queue program specified in the style of dynamic frames.

 // Rustan Leino, Michal Moskal, and Wolfram Schulte, 2007.

diff --git a/Test/textbook/Bubble.bpl b/Test/textbook/Bubble.bpl
index 937ab7e5..702b2cc9 100644
--- a/Test/textbook/Bubble.bpl
+++ b/Test/textbook/Bubble.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // Bubble Sort, where the specification says the output is a permutation of

 // the input.

 

diff --git a/Test/textbook/DivMod.bpl b/Test/textbook/DivMod.bpl
index de218604..bdbc4f19 100644
--- a/Test/textbook/DivMod.bpl
+++ b/Test/textbook/DivMod.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // This file contains two definitions of integer div/mod (truncated division, as is

 // used in C, C#, Java, and several other languages, and Euclidean division, which

 // has mathematical appeal and is used by SMT Lib) and proves the correct

diff --git a/Test/textbook/DutchFlag.bpl b/Test/textbook/DutchFlag.bpl
index 64743303..8bac6aec 100644
--- a/Test/textbook/DutchFlag.bpl
+++ b/Test/textbook/DutchFlag.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // The partition step of Quick Sort picks a 'pivot' element from a specified subsection

 // of a given integer array.  It then partially sorts the elements of the array so that

 // elements smaller than the pivot end up to the left of the pivot and elements larger

diff --git a/Test/textbook/Find.bpl b/Test/textbook/Find.bpl
index 2b149baf..5a77c621 100644
--- a/Test/textbook/Find.bpl
+++ b/Test/textbook/Find.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // Declare a constant 'K' and a function 'f' and postulate that 'K' is

 // in the image of 'f'

 const K: int;

diff --git a/Test/textbook/McCarthy-91.bpl b/Test/textbook/McCarthy-91.bpl
index 895c8e8c..6bfbcb04 100644
--- a/Test/textbook/McCarthy-91.bpl
+++ b/Test/textbook/McCarthy-91.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // McCarthy 91 function

 procedure F(n: int) returns (r: int)

   ensures 100 < n ==> r == n - 10;

diff --git a/Test/textbook/TuringFactorial.bpl b/Test/textbook/TuringFactorial.bpl
index d0c40e84..dffc36ab 100644
--- a/Test/textbook/TuringFactorial.bpl
+++ b/Test/textbook/TuringFactorial.bpl
@@ -1,5 +1,5 @@
-// RUN: %boogie %s > %t

-// RUN: %diff %s.expect %t

+// RUN: %boogie "%s" > "%t"

+// RUN: %diff "%s.expect" "%t"

 // A Boogie version of Turing's additive factorial program, from "Checking a large routine"

 // published in the "Report of a Conference of High Speed Automatic Calculating Machines",

 // pp. 67-69, 1949.