/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 334 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) TRUE


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
public class Diff {
    // We assume that A and B have no repetitions.
 static void dif(int[] A, int[] B, int[] D){
    int k=0;
    int i=0;
    int l1=A.length;
    int l2=B.length;
    boolean found;
    while(i<l1){
        int j=0;
        found=false;
	while((j<l2)&&(!found)){
	  if(A[i]==B[j]) found=true;
	  else j++;
         }

	if (!found) {
            D[k]=A[i];
	    k++;
	}
      i++;
    }
 }

    public static void main(String[] args) {
	dif(new int[20],new int[20],new int[20]);
    }
}



----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
public class Diff {
    // We assume that A and B have no repetitions.
 static void dif(int[] A, int[] B, int[] D){
    int k=0;
    int i=0;
    int l1=A.length;
    int l2=B.length;
    boolean found;
    while(i<l1){
        int j=0;
        found=false;
	while((j<l2)&&(!found)){
	  if(A[i]==B[j]) found=true;
	  else j++;
         }

	if (!found) {
            D[k]=A[i];
	    k++;
	}
      i++;
    }
 }

    public static void main(String[] args) {
	dif(new int[20],new int[20],new int[20]);
    }
}



----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
Diff.main([Ljava/lang/String;)V: Graph of 643 nodes with 0 SCCs.





----------------------------------------

(5) TerminationGraphToSCCProof (SOUND)
Proven termination by absence of SCCs
----------------------------------------

(6)
TRUE