YES

2019-05-11 07:09:41,486 INFO  [UltimateCore.java:185]: Initializing application
2019-05-11 07:09:41,489 INFO  [UltimateCore.java:202]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,492 INFO  [PluginFactory.java:62]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,493 INFO  [PluginFactory.java:63]: Detecting plugins...
2019-05-11 07:09:41,493 INFO  [PluginFactory.java:287]: 1 IController plugins available
2019-05-11 07:09:41,494 INFO  [PluginFactory.java:287]: 4 ISource plugins available
2019-05-11 07:09:41,494 INFO  [PluginFactory.java:287]: 1 IOutput plugins available
2019-05-11 07:09:41,494 INFO  [PluginFactory.java:287]: 10 IGenerator plugins available
2019-05-11 07:09:41,495 INFO  [PluginFactory.java:287]: 5 IAnalysis plugins available
2019-05-11 07:09:41,497 INFO  [PluginFactory.java:241]: Loaded  controller UltimateCore
2019-05-11 07:09:41,497 INFO  [PluginFactory.java:70]: Finished detecting plugins!
2019-05-11 07:09:41,498 INFO  [PluginFactory.java:71]: Loading services ...
2019-05-11 07:09:41,498 INFO  [PluginFactory.java:272]: 0 IServiceFactory services available
2019-05-11 07:09:41,498 INFO  [PluginFactory.java:73]: Finished loading services!
2019-05-11 07:09:41,498 INFO  [PluginFactory.java:74]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,500 INFO  [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf
2019-05-11 07:09:43,554 INFO  [SettingsManager.java:54]: Loading preferences was successful
2019-05-11 07:09:43,554 INFO  [SettingsManager.java:55]: Preferences different from defaults:
2019-05-11 07:09:43,554 INFO  [PluginFactory.java:178]: --------------------------------------------------------------------------------
2019-05-11 07:09:43,555 INFO  [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences)
2019-05-11 07:09:43,903 INFO  [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible)
2019-05-11 07:09:43,904 INFO  [PluginFactory.java:198]: --------------------------------------------------------------------------------
2019-05-11 07:09:43,904 INFO  [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults:
2019-05-11 07:09:43,904 INFO  [SettingsManager.java:63]:  * Only non-decreasing invariants=true
2019-05-11 07:09:43,904 INFO  [SettingsManager.java:63]:  * Termination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:43,904 INFO  [SettingsManager.java:63]:  * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true
2019-05-11 07:09:43,905 INFO  [SettingsManager.java:63]:  * Nontermination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:43,905 INFO  [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults:
2019-05-11 07:09:43,905 INFO  [SettingsManager.java:63]:  * Rating-Boundary (empty for LBE)=0
2019-05-11 07:09:43,905 INFO  [SettingsManager.java:63]:  * Strategy for the edge rating=DISJUNCTIVE_RATING
2019-05-11 07:09:43,905 INFO  [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults:
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:63]:  * Lasso Analysis=Linear_with_guesses
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:63]:  * Use external solver (rank synthesis)=false
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:63]:  * Buchi interpolant automaton=StagedBlast
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:63]:  * Construct termination proof for TermComp=true
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults:
2019-05-11 07:09:43,906 INFO  [SettingsManager.java:63]:  * Check unreachability of error function in SV-COMP mode=false
2019-05-11 07:09:43,907 INFO  [SettingsManager.java:63]:  * Size of pointer (in bytes)=8
2019-05-11 07:09:43,907 INFO  [SettingsManager.java:63]:  * Check if freed pointer was valid=false
2019-05-11 07:09:43,907 INFO  [SettingsManager.java:63]:  * How to treat unsigned ints differently from normal ones=IGNORE
2019-05-11 07:09:43,907 INFO  [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults:
2019-05-11 07:09:43,907 INFO  [SettingsManager.java:63]:  * Timeout in seconds=100000
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:63]:  * The redirection strategy for Impulse=RANDOmSTRONGEST
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults:
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:63]:  * Size of a code block=SequenceOfStatements
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:63]:  * Convert code blocks to CNF=false
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:63]:  * To the following directory=/home/matthias/ultimate/dump
2019-05-11 07:09:43,908 INFO  [SettingsManager.java:63]:  * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults:
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:63]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:43,909 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:43,910 INFO  [UltimateCore.java:76]: Initializing controller ...
2019-05-11 07:09:44,123 INFO  [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp
2019-05-11 07:09:44,129 INFO  [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:44,129 INFO  [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated...
2019-05-11 07:09:44,132 INFO  [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected.
2019-05-11 07:09:44,133 INFO  [PluginConnector.java:252]: Initializing CDTParser...
2019-05-11 07:09:44,133 INFO  [PluginConnector.java:257]: CDTParser initialized
2019-05-11 07:09:44,134 INFO  [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:44,256 INFO  [ToolchainManager.java:238]: ####################### [Toolchain 1] #######################
2019-05-11 07:09:44,258 INFO  [ToolchainWalker.java:61]: Walking toolchain with 6 elements.
2019-05-11 07:09:44,258 INFO  [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:44,258 INFO  [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator...
2019-05-11 07:09:44,261 INFO  [PluginConnector.java:257]: CACSL2BoogieTranslator initialized
2019-05-11 07:09:44,262 INFO  [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,371 INFO  [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:44,371 INFO  [PluginConnector.java:90]: ------------------------Boogie Preprocessor----------------------------
2019-05-11 07:09:44,371 INFO  [PluginConnector.java:252]: Initializing Boogie Preprocessor...
2019-05-11 07:09:44,372 INFO  [PluginConnector.java:257]: Boogie Preprocessor initialized
2019-05-11 07:09:44,387 INFO  [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,392 INFO  [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,392 INFO  [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,394 INFO  [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,396 INFO  [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,396 INFO  [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,397 INFO  [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor----------------------------
2019-05-11 07:09:44,398 INFO  [PluginConnector.java:90]: ------------------------RCFGBuilder----------------------------
2019-05-11 07:09:44,398 INFO  [PluginConnector.java:252]: Initializing RCFGBuilder...
2019-05-11 07:09:44,398 INFO  [PluginConnector.java:257]: RCFGBuilder initialized
2019-05-11 07:09:44,399 INFO  [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,494 INFO  [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
2019-05-11 07:09:44,496 INFO  [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:09:44,620 INFO  [PluginConnector.java:110]: ------------------------ END RCFGBuilder----------------------------
2019-05-11 07:09:44,621 INFO  [PluginConnector.java:90]: ------------------------BlockEncoding----------------------------
2019-05-11 07:09:44,621 INFO  [PluginConnector.java:252]: Initializing BlockEncoding...
2019-05-11 07:09:44,622 INFO  [PluginConnector.java:257]: BlockEncoding initialized
2019-05-11 07:09:44,623 INFO  [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,637 INFO  [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:44,652 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:44,654 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:44,691 INFO  [PluginConnector.java:110]: ------------------------ END BlockEncoding----------------------------
2019-05-11 07:09:44,691 INFO  [PluginConnector.java:90]: ------------------------TraceAbstraction----------------------------
2019-05-11 07:09:44,692 INFO  [PluginConnector.java:252]: Initializing TraceAbstraction...
2019-05-11 07:09:44,693 INFO  [PluginConnector.java:257]: TraceAbstraction initialized
2019-05-11 07:09:44,694 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:44" (1/5) ...
2019-05-11 07:09:44,695 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:44" (2/5) ...
2019-05-11 07:09:44,695 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:44" (3/5) ...
2019-05-11 07:09:44,695 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:44" (4/5) ...
2019-05-11 07:09:44,696 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:44" (5/5) ...
Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
2019-05-11 07:09:44,798 INFO  [PluginConnector.java:110]: ------------------------ END TraceAbstraction----------------------------
2019-05-11 07:09:44,798 INFO  [PluginConnector.java:90]: ------------------------BuchiAutomizer----------------------------
2019-05-11 07:09:44,798 INFO  [PluginConnector.java:252]: Initializing BuchiAutomizer...
2019-05-11 07:09:44,799 INFO  [PluginConnector.java:257]: BuchiAutomizer initialized
2019-05-11 07:09:44,801 INFO  [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:09:44" (1/1) ...
2019-05-11 07:09:47,930 INFO  [PluginConnector.java:110]: ------------------------ END BuchiAutomizer----------------------------
2019-05-11 07:09:47,931 INFO  [Benchmark.java:150]: Toolchain (without parser) took 3674.42 ms. Allocated memory was 643.3 MB in the beginning and 751.3 MB in the end (delta: 108.0 MB). Free memory was 606.8 MB in the beginning and 677.8 MB in the end (delta: -71.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,934 INFO  [Benchmark.java:150]: CDTParser took 111.44 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 608.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,935 INFO  [Benchmark.java:150]: CACSL2BoogieTranslator took 113.13 ms. Allocated memory is still 643.3 MB. Free memory was 606.8 MB in the beginning and 600.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,935 INFO  [Benchmark.java:150]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,936 INFO  [Benchmark.java:150]: RCFGBuilder took 222.86 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 583.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,937 INFO  [Benchmark.java:150]: BlockEncoding took 70.06 ms. Allocated memory is still 643.3 MB. Free memory was 582.0 MB in the beginning and 577.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,938 INFO  [Benchmark.java:150]: TraceAbstraction took 106.97 ms. Allocated memory is still 643.3 MB. Free memory was 577.9 MB in the beginning and 571.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,938 INFO  [Benchmark.java:150]: BuchiAutomizer took 3131.83 ms. Allocated memory was 643.3 MB in the beginning and 751.3 MB in the end (delta: 108.0 MB). Free memory was 571.2 MB in the beginning and 677.8 MB in the end (delta: -106.6 MB). Peak memory consumption was 1.4 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,945 INFO  [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result.
RESULT: Ultimate could not prove your program: Toolchain returned no Result.
2019-05-11 07:09:47,946 INFO  [ToolchainManager.java:286]: #######################  End [Toolchain 1] #######################
2019-05-11 07:09:47,946 INFO  [BasicToolchainJob.java:73]:  --- Results ---
2019-05-11 07:09:47,946 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
2019-05-11 07:09:47,946 INFO  [BasicToolchainJob.java:89]:   - AllSpecificationsHoldResult: All specifications hold
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:95]:     We were not able to verify any specifiation because the program does not contain any specification.
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:89]:   - ProcedureContractResult [Line: 13]: Procedure Contract for main
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:95]:     Derived contract for procedure main: 1
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 18]: Loop Invariant
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Ultimate Automizer benchmark data
2019-05-11 07:09:47,947 INFO  [BasicToolchainJob.java:95]:     CFG has 17 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 17 states and ocurred in iteration 0.	InterpolantCoveringCapability: 0/0	ICC %: NaN	EdgeCheckerBenchmarkData: No data available	TraceCheckerBenchmark: No data available	InterpolantConsolidationBenchmark: No data available	
2019-05-11 07:09:47,948 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
2019-05-11 07:09:47,948 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed decomposition of program
2019-05-11 07:09:47,948 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into 8 terminating modules (1 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function y + 0 and consists of 6 locations. One deterministic module has affine ranking function -1 * x + 0 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 6 locations. One deterministic module has affine ranking function -1 * x + 0 and consists of 5 locations. One deterministic module has affine ranking function y + 0 and consists of 5 locations. One nondeterministic module has affine ranking function y + 0 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * x + 0 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations.
2019-05-11 07:09:47,948 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed termination proof in form of nested word automata
2019-05-11 07:09:47,948 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into the following automata 
NestedWordAutomaton finiteAutomatonIteration6 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "3074#(<= main_~y~2 oldRank0)" "3044#unseeded" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"3044#unseeded" },
	finalStates = {"3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" },
	callTransitions = {
		 ("3044#unseeded" "call #t~ret6 := main();" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3044#unseeded" "call ULTIMATE.init();" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3074#(<= main_~y~2 oldRank0)" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3074#(<= main_~y~2 oldRank0)" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3074#(<= main_~y~2 oldRank0)" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(~x~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume ~x~2 > 0;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "3044#unseeded" "return;" "3044#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration1 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "72#(<= main_~y~2 oldRank0)" "62#unseeded" "30#false" },
	initialStates = {"62#unseeded" },
	finalStates = {"71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "30#false" },
	callTransitions = {
		 ("62#unseeded" "call #t~ret6 := main();" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("62#unseeded" "call ULTIMATE.init();" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !true;" "30#false")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(~x~2 > 0);" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "#res := 0;assume true;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(~x~2 != 0 && ~y~2 > 0);" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume ~x~2 > 0;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume !true;" "30#false")
		 ("71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("71#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("72#(<= main_~y~2 oldRank0)" "assume !true;" "30#false")
		 ("72#(<= main_~y~2 oldRank0)" "#res := 0;assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("72#(<= main_~y~2 oldRank0)" "assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("72#(<= main_~y~2 oldRank0)" "assume !!(~x~2 != 0 && ~y~2 > 0);" "82#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("72#(<= main_~y~2 oldRank0)" "assume !(~x~2 != 0 && ~y~2 > 0);" "72#(<= main_~y~2 oldRank0)")
		 ("72#(<= main_~y~2 oldRank0)" "assume true;" "72#(<= main_~y~2 oldRank0)")
		 ("30#false" "#res := 0;assume true;" "30#false")
		 ("30#false" "assume true;" "30#false")
	},
	returnTransitions = {
		 ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "62#unseeded" "return;" "62#unseeded")
		 ("30#false" "62#unseeded" "return;" "30#false")
	}
);

NestedWordAutomaton buchiAutomatonIteration2 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"224#(<= 0 (+ main_~x~2 oldRank0))" "242#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" "213#unseeded" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" },
	initialStates = {"213#unseeded" },
	finalStates = {"223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" },
	callTransitions = {
		 ("213#unseeded" "call #t~ret6 := main();" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("213#unseeded" "call ULTIMATE.init();" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);" "242#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume ~x~2 > 0;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("224#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("242#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
		 ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
		 ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "224#(<= 0 (+ main_~x~2 oldRank0))")
		 ("223#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "224#(<= 0 (+ main_~x~2 oldRank0))")
	},
	returnTransitions = {
		 ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "213#unseeded" "return;" "213#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration3 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"434#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "435#(<= main_~x~2 oldRank0)" "411#unseeded" "364#false" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"411#unseeded" },
	finalStates = {"434#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "364#false" },
	callTransitions = {
		 ("411#unseeded" "call #t~ret6 := main();" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("411#unseeded" "call ULTIMATE.init();" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("434#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "435#(<= main_~x~2 oldRank0)")
		 ("435#(<= main_~x~2 oldRank0)" "assume true;" "435#(<= main_~x~2 oldRank0)")
		 ("435#(<= main_~x~2 oldRank0)" "assume !(~x~2 > 0);" "435#(<= main_~x~2 oldRank0)")
		 ("435#(<= main_~x~2 oldRank0)" "assume true;" "435#(<= main_~x~2 oldRank0)")
		 ("435#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != 0 && ~y~2 > 0);" "435#(<= main_~x~2 oldRank0)")
		 ("435#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("435#(<= main_~x~2 oldRank0)" "assume true;" "435#(<= main_~x~2 oldRank0)")
		 ("364#false" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "364#false")
		 ("364#false" "assume true;" "364#false")
		 ("364#false" "assume !(~x~2 > 0);" "364#false")
		 ("364#false" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "364#false")
		 ("364#false" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "364#false")
		 ("364#false" "assume true;" "364#false")
		 ("364#false" "assume !!(~x~2 != 0 && ~y~2 > 0);" "364#false")
		 ("364#false" "assume ~x~2 > 0;" "364#false")
		 ("364#false" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "364#false")
		 ("364#false" "assume true;" "364#false")
		 ("364#false" "assume true;" "364#false")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "434#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume !(~x~2 > 0);" "364#false")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume ~x~2 > 0;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "477#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "434#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("414#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "411#unseeded" "return;" "411#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration4 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"673#unseeded" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "711#(<= 0 (+ main_~x~2 oldRank0))" "781#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" },
	initialStates = {"673#unseeded" },
	finalStates = {"710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" },
	callTransitions = {
		 ("673#unseeded" "call #t~ret6 := main();" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#unseeded" "call ULTIMATE.init();" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
		 ("710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);" "781#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume ~x~2 > 0;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("711#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "711#(<= 0 (+ main_~x~2 oldRank0))")
		 ("781#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "710#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
	},
	returnTransitions = {
		 ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "673#unseeded" "return;" "673#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration5 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "2104#unseeded" "2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "2122#(<= main_~y~2 oldRank0)" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"2104#unseeded" },
	finalStates = {"2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" },
	callTransitions = {
		 ("2104#unseeded" "call #t~ret6 := main();" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2104#unseeded" "call ULTIMATE.init();" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "2122#(<= main_~y~2 oldRank0)")
		 ("2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume ~x~2 > 0;" "2122#(<= main_~y~2 oldRank0)")
		 ("2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2122#(<= main_~y~2 oldRank0)" "assume true;" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume !(~x~2 > 0);" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2122#(<= main_~y~2 oldRank0)" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume true;" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume !!(~x~2 != 0 && ~y~2 > 0);" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume ~x~2 > 0;" "2122#(<= main_~y~2 oldRank0)")
		 ("2122#(<= main_~y~2 oldRank0)" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2131#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2122#(<= main_~y~2 oldRank0)" "assume true;" "2122#(<= main_~y~2 oldRank0)")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "2121#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("2107#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2104#unseeded" "return;" "2104#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration6 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "3074#(<= main_~y~2 oldRank0)" "3044#unseeded" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"3044#unseeded" },
	finalStates = {"3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" },
	callTransitions = {
		 ("3044#unseeded" "call #t~ret6 := main();" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3044#unseeded" "call ULTIMATE.init();" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3074#(<= main_~y~2 oldRank0)" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3074#(<= main_~y~2 oldRank0)" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3074#(<= main_~y~2 oldRank0)" "assume true;" "3074#(<= main_~y~2 oldRank0)")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(~x~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume ~x~2 > 0;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "3124#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "3073#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("3047#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "3044#unseeded" "return;" "3044#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration7 = (
	callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume true;" "assume !(~x~2 > 0);" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "assume true;" "assume !(~x~2 != 0 && ~y~2 > 0);" "assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 != 0 && ~y~2 > 0);" "assume ~x~2 > 0;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;" "assume true;" },
	returnAlphabet = {"return;" "return;" },
	states = {"4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "4849#(<= 0 (+ main_~x~2 oldRank0))" "4867#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" "4829#unseeded" },
	initialStates = {"4829#unseeded" },
	finalStates = {"4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" },
	callTransitions = {
		 ("4829#unseeded" "call #t~ret6 := main();" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4829#unseeded" "call ULTIMATE.init();" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 - 1;~x~2 := #t~nondet5;havoc #t~nondet5;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "4849#(<= 0 (+ main_~x~2 oldRank0))")
		 ("4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "4849#(<= 0 (+ main_~x~2 oldRank0))")
		 ("4849#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "4849#(<= 0 (+ main_~x~2 oldRank0))")
		 ("4849#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);" "4867#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))")
		 ("4849#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "4849#(<= 0 (+ main_~x~2 oldRank0))")
		 ("4849#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0 && ~y~2 > 0);" "4849#(<= 0 (+ main_~x~2 oldRank0))")
		 ("4867#(and (<= 0 (+ main_~x~2 oldRank0)) (<= main_~x~2 0))" "assume #t~nondet4 != 0;havoc #t~nondet4;~x~2 := ~x~2 + 1;" "4848#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))")
	},
	returnTransitions = {
		 ("4832#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "4829#unseeded" "return;" "4829#unseeded")
	}
);


2019-05-11 07:09:47,950 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Timing statistics
2019-05-11 07:09:47,951 INFO  [BasicToolchainJob.java:95]:     BüchiAutomizer plugin needed 3.1s and 8 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization removed 324 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 308 states and ocurred in iteration 5.	Nontrivial modules had stage [5, 0, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 3/3	InterpolantCoveringCapabilityBuchi: 0/0	EdgeCheckerBenchmarkData: HoareTripleChecks: 20 SDtfs, 9 SDslu, 15 SDs, 0 lazy, 613 Sat,459 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.5s	LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks:   Termination: inital21 mio100 ax100 hnf91 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf101 smp80 dnf100 smp100 tf112 neg100 sie100    Nontermination: inital21 mio100 ax100 hnf91 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf101 smp80 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 
2019-05-11 07:09:47,952 INFO  [BasicToolchainJob.java:89]:   - TerminationAnalysisResult: Termination proven
2019-05-11 07:09:47,952 INFO  [BasicToolchainJob.java:95]:     Buchi Automizer proved that your program is terminating
2019-05-11 07:09:47,952 INFO  [BasicToolchainJob.java:75]:  * Results from UltimateCore:
2019-05-11 07:09:47,952 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Toolchain Benchmarks
2019-05-11 07:09:47,959 INFO  [BasicToolchainJob.java:95]:     Benchmark results are:
 * CDTParser took 111.44 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 608.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB
 * CACSL2BoogieTranslator took 113.13 ms. Allocated memory is still 643.3 MB. Free memory was 606.8 MB in the beginning and 600.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * Boogie Preprocessor took 26.25 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
 * RCFGBuilder took 222.86 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 583.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB
 * BlockEncoding took 70.06 ms. Allocated memory is still 643.3 MB. Free memory was 582.0 MB in the beginning and 577.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB
 * TraceAbstraction took 106.97 ms. Allocated memory is still 643.3 MB. Free memory was 577.9 MB in the beginning and 571.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * BuchiAutomizer took 3131.83 ms. Allocated memory was 643.3 MB in the beginning and 751.3 MB in the end (delta: 108.0 MB). Free memory was 571.2 MB in the beginning and 677.8 MB in the end (delta: -106.6 MB). Peak memory consumption was 1.4 MB. Max. memory is 53.1 GB
2019-05-11 07:09:47,986 INFO  [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0
Closed successfully