YES

2019-05-11 07:09:00,575 INFO  [UltimateCore.java:185]: Initializing application
2019-05-11 07:09:00,578 INFO  [UltimateCore.java:202]: --------------------------------------------------------------------------------
2019-05-11 07:09:00,582 INFO  [PluginFactory.java:62]: --------------------------------------------------------------------------------
2019-05-11 07:09:00,582 INFO  [PluginFactory.java:63]: Detecting plugins...
2019-05-11 07:09:00,583 INFO  [PluginFactory.java:287]: 1 IController plugins available
2019-05-11 07:09:00,583 INFO  [PluginFactory.java:287]: 4 ISource plugins available
2019-05-11 07:09:00,583 INFO  [PluginFactory.java:287]: 1 IOutput plugins available
2019-05-11 07:09:00,584 INFO  [PluginFactory.java:287]: 10 IGenerator plugins available
2019-05-11 07:09:00,584 INFO  [PluginFactory.java:287]: 5 IAnalysis plugins available
2019-05-11 07:09:00,586 INFO  [PluginFactory.java:241]: Loaded  controller UltimateCore
2019-05-11 07:09:00,587 INFO  [PluginFactory.java:70]: Finished detecting plugins!
2019-05-11 07:09:00,587 INFO  [PluginFactory.java:71]: Loading services ...
2019-05-11 07:09:00,587 INFO  [PluginFactory.java:272]: 0 IServiceFactory services available
2019-05-11 07:09:00,588 INFO  [PluginFactory.java:73]: Finished loading services!
2019-05-11 07:09:00,588 INFO  [PluginFactory.java:74]: --------------------------------------------------------------------------------
2019-05-11 07:09:00,590 INFO  [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf
2019-05-11 07:09:03,686 INFO  [SettingsManager.java:54]: Loading preferences was successful
2019-05-11 07:09:03,687 INFO  [SettingsManager.java:55]: Preferences different from defaults:
2019-05-11 07:09:03,687 INFO  [PluginFactory.java:178]: --------------------------------------------------------------------------------
2019-05-11 07:09:03,687 INFO  [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences)
2019-05-11 07:09:04,037 INFO  [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible)
2019-05-11 07:09:04,038 INFO  [PluginFactory.java:198]: --------------------------------------------------------------------------------
2019-05-11 07:09:04,038 INFO  [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults:
2019-05-11 07:09:04,039 INFO  [SettingsManager.java:63]:  * Only non-decreasing invariants=true
2019-05-11 07:09:04,039 INFO  [SettingsManager.java:63]:  * Termination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:04,039 INFO  [SettingsManager.java:63]:  * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true
2019-05-11 07:09:04,039 INFO  [SettingsManager.java:63]:  * Nontermination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:04,039 INFO  [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults:
2019-05-11 07:09:04,040 INFO  [SettingsManager.java:63]:  * Rating-Boundary (empty for LBE)=0
2019-05-11 07:09:04,040 INFO  [SettingsManager.java:63]:  * Strategy for the edge rating=DISJUNCTIVE_RATING
2019-05-11 07:09:04,040 INFO  [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults:
2019-05-11 07:09:04,040 INFO  [SettingsManager.java:63]:  * Lasso Analysis=Linear_with_guesses
2019-05-11 07:09:04,040 INFO  [SettingsManager.java:63]:  * Use external solver (rank synthesis)=false
2019-05-11 07:09:04,041 INFO  [SettingsManager.java:63]:  * Buchi interpolant automaton=StagedBlast
2019-05-11 07:09:04,041 INFO  [SettingsManager.java:63]:  * Construct termination proof for TermComp=true
2019-05-11 07:09:04,041 INFO  [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults:
2019-05-11 07:09:04,041 INFO  [SettingsManager.java:63]:  * Check unreachability of error function in SV-COMP mode=false
2019-05-11 07:09:04,042 INFO  [SettingsManager.java:63]:  * Size of pointer (in bytes)=8
2019-05-11 07:09:04,042 INFO  [SettingsManager.java:63]:  * Check if freed pointer was valid=false
2019-05-11 07:09:04,042 INFO  [SettingsManager.java:63]:  * How to treat unsigned ints differently from normal ones=IGNORE
2019-05-11 07:09:04,042 INFO  [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults:
2019-05-11 07:09:04,042 INFO  [SettingsManager.java:63]:  * Timeout in seconds=100000
2019-05-11 07:09:04,043 INFO  [SettingsManager.java:63]:  * The redirection strategy for Impulse=RANDOmSTRONGEST
2019-05-11 07:09:04,043 INFO  [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults:
2019-05-11 07:09:04,043 INFO  [SettingsManager.java:63]:  * Size of a code block=SequenceOfStatements
2019-05-11 07:09:04,043 INFO  [SettingsManager.java:63]:  * Convert code blocks to CNF=false
2019-05-11 07:09:04,043 INFO  [SettingsManager.java:63]:  * To the following directory=/home/matthias/ultimate/dump
2019-05-11 07:09:04,044 INFO  [SettingsManager.java:63]:  * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:09:04,044 INFO  [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults:
2019-05-11 07:09:04,044 INFO  [SettingsManager.java:63]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
2019-05-11 07:09:04,044 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:04,044 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:04,045 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:04,045 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:04,045 INFO  [UltimateCore.java:76]: Initializing controller ...
2019-05-11 07:09:04,262 INFO  [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp
2019-05-11 07:09:04,270 INFO  [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:04,270 INFO  [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated...
2019-05-11 07:09:04,273 INFO  [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected.
2019-05-11 07:09:04,274 INFO  [PluginConnector.java:252]: Initializing CDTParser...
2019-05-11 07:09:04,274 INFO  [PluginConnector.java:257]: CDTParser initialized
2019-05-11 07:09:04,275 INFO  [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:04,401 INFO  [ToolchainManager.java:238]: ####################### [Toolchain 1] #######################
2019-05-11 07:09:04,404 INFO  [ToolchainWalker.java:61]: Walking toolchain with 6 elements.
2019-05-11 07:09:04,404 INFO  [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:04,405 INFO  [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator...
2019-05-11 07:09:04,408 INFO  [PluginConnector.java:257]: CACSL2BoogieTranslator initialized
2019-05-11 07:09:04,409 INFO  [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:04" (1/1) ...
2019-05-11 07:09:04,519 INFO  [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:04,519 INFO  [PluginConnector.java:90]: ------------------------Boogie Preprocessor----------------------------
2019-05-11 07:09:04,520 INFO  [PluginConnector.java:252]: Initializing Boogie Preprocessor...
2019-05-11 07:09:04,520 INFO  [PluginConnector.java:257]: Boogie Preprocessor initialized
2019-05-11 07:09:04,535 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:04" (1/1) ...
2019-05-11 07:09:04,540 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:04" (1/1) ...
2019-05-11 07:09:04,540 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:04" (1/1) ...
2019-05-11 07:09:04,542 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:04" (1/1) ...
2019-05-11 07:09:04,543 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:04" (1/1) ...
2019-05-11 07:09:04,544 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:04" (1/1) ...
2019-05-11 07:09:04,545 INFO  [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor----------------------------
2019-05-11 07:09:04,546 INFO  [PluginConnector.java:90]: ------------------------RCFGBuilder----------------------------
2019-05-11 07:09:04,546 INFO  [PluginConnector.java:252]: Initializing RCFGBuilder...
2019-05-11 07:09:04,546 INFO  [PluginConnector.java:257]: RCFGBuilder initialized
2019-05-11 07:09:04,547 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:04" (1/1) ...
2019-05-11 07:09:04,647 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:04,649 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:04,766 INFO  [PluginConnector.java:110]: ------------------------ END RCFGBuilder----------------------------
2019-05-11 07:09:04,767 INFO  [PluginConnector.java:90]: ------------------------BlockEncoding----------------------------
2019-05-11 07:09:04,767 INFO  [PluginConnector.java:252]: Initializing BlockEncoding...
2019-05-11 07:09:04,768 INFO  [PluginConnector.java:257]: BlockEncoding initialized
2019-05-11 07:09:04,768 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:04" (1/1) ...
2019-05-11 07:09:04,783 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:04" (1/1) ...
2019-05-11 07:09:04,832 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:04,833 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:04,834 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:04,835 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:04,836 INFO  [PluginConnector.java:110]: ------------------------ END BlockEncoding----------------------------
2019-05-11 07:09:04,836 INFO  [PluginConnector.java:90]: ------------------------TraceAbstraction----------------------------
2019-05-11 07:09:04,836 INFO  [PluginConnector.java:252]: Initializing TraceAbstraction...
2019-05-11 07:09:04,838 INFO  [PluginConnector.java:257]: TraceAbstraction initialized
2019-05-11 07:09:04,838 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:04" (1/5) ...
2019-05-11 07:09:04,839 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:04" (2/5) ...
2019-05-11 07:09:04,839 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:04" (3/5) ...
2019-05-11 07:09:04,840 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:04" (4/5) ...
2019-05-11 07:09:04,840 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:04" (5/5) ...
Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
2019-05-11 07:09:04,938 INFO  [PluginConnector.java:110]: ------------------------ END TraceAbstraction----------------------------
2019-05-11 07:09:04,939 INFO  [PluginConnector.java:90]: ------------------------BuchiAutomizer----------------------------
2019-05-11 07:09:04,939 INFO  [PluginConnector.java:252]: Initializing BuchiAutomizer...
2019-05-11 07:09:04,939 INFO  [PluginConnector.java:257]: BuchiAutomizer initialized
2019-05-11 07:09:04,941 INFO  [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:04" (1/1) ...
2019-05-11 07:09:08,066 INFO  [PluginConnector.java:110]: ------------------------ END BuchiAutomizer----------------------------
2019-05-11 07:09:08,068 INFO  [Benchmark.java:150]: Toolchain (without parser) took 3665.65 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 606.8 MB in the beginning and 367.6 MB in the end (delta: 239.2 MB). Peak memory consumption was 242.4 MB. Max. memory is 53.1 GB
2019-05-11 07:09:08,070 INFO  [Benchmark.java:150]: CDTParser took 115.95 ms. Allocated memory is still 643.3 MB. Free memory was 614.9 MB in the beginning and 608.1 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:08,071 INFO  [Benchmark.java:150]: CACSL2BoogieTranslator took 114.42 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:08,072 INFO  [Benchmark.java:150]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.8 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:08,073 INFO  [Benchmark.java:150]: RCFGBuilder took 220.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB
2019-05-11 07:09:08,073 INFO  [Benchmark.java:150]: BlockEncoding took 69.18 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 577.2 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:08,074 INFO  [Benchmark.java:150]: TraceAbstraction took 102.47 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 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:08,075 INFO  [Benchmark.java:150]: BuchiAutomizer took 3128.08 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 367.6 MB in the end (delta: 202.9 MB). Peak memory consumption was 206.1 MB. Max. memory is 53.1 GB
2019-05-11 07:09:08,082 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:08,082 INFO  [ToolchainManager.java:286]: #######################  End [Toolchain 1] #######################
2019-05-11 07:09:08,083 INFO  [BasicToolchainJob.java:73]:  --- Results ---
2019-05-11 07:09:08,083 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
2019-05-11 07:09:08,083 INFO  [BasicToolchainJob.java:89]:   - AllSpecificationsHoldResult: All specifications hold
2019-05-11 07:09:08,083 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:08,083 INFO  [BasicToolchainJob.java:89]:   - ProcedureContractResult [Line: 14]: Procedure Contract for main
2019-05-11 07:09:08,083 INFO  [BasicToolchainJob.java:95]:     Derived contract for procedure main: 1
2019-05-11 07:09:08,083 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 22]: Loop Invariant
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 24]: Loop Invariant
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Ultimate Automizer benchmark data
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:95]:     CFG has 13 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 13 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:08,084 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
2019-05-11 07:09:08,084 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed decomposition of program
2019-05-11 07:09:08,085 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if x + 0 > 0 then 1 else 0), (if x + 0 > 0 then x + 0 else y + 0) and consists of 6 locations. One deterministic module has affine ranking function z + -1 * y + 0 and consists of 5 locations. One deterministic module has 2-nested ranking function (if x + 0 > 0 then 1 else 0), (if x + 0 > 0 then x + 0 else y + x + 0) and consists of 6 locations. One deterministic module has affine ranking function y + 0 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * y + z + 0 and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if x + 0 > 0 then 1 else 0), (if x + 0 > 0 then x + 0 else x + y + 0) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations.
2019-05-11 07:09:08,085 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed termination proof in form of nested word automata
2019-05-11 07:09:08,085 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into the following automata 
NestedWordAutomaton finiteAutomatonIteration6 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "1096#unseeded" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" },
	initialStates = {"1096#unseeded" },
	finalStates = {"1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" },
	callTransitions = {
		 ("1096#unseeded" "call ULTIMATE.init();" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1096#unseeded" "call #t~ret3 := main();" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "assume true;assume !(~y~2 < ~z~2);" "1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "~y~2 := ~x~2 + ~y~2;" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "~y~2 := ~x~2 + ~y~2;" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~x~2 + ~y~2;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
	},
	returnTransitions = {
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1096#unseeded" "return;" "1096#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration1 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"51#unseeded" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))" "61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))" "29#false" "62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))" },
	initialStates = {"51#unseeded" },
	finalStates = {"61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))" "29#false" },
	callTransitions = {
		 ("51#unseeded" "call ULTIMATE.init();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("51#unseeded" "call #t~ret3 := main();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("51#unseeded" "assume true;" "51#unseeded")
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))")
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))" "assume true;assume !(~y~2 < ~z~2);" "72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))")
		 ("72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))" "~y~2 := ~x~2 + ~y~2;" "61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))")
		 ("72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))" "assume !true;" "29#false")
		 ("61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))" "assume true;assume !(~y~2 >= 1);" "62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))")
		 ("61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))" "assume !true;" "29#false")
		 ("61#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1) (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0)))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "72#(or (and (<= (+ main_~x~2 1) 0) (<= 1 0) (<= 0 oldRank0) (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= 1 main_~y~2)) (and (<= (+ main_~x~2 1) 0) (<= main_~y~2 oldRank1) (<= 1 0) (<= 1 main_~y~2) (<= 1 oldRank0)) (and (<= 1 oldRank1) (<= 1 main_~y~2) (<= (+ main_~x~2 1) oldRank1) (<= 1 oldRank0)))")
		 ("29#false" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "29#false")
		 ("29#false" "assume true;assume !(~y~2 < ~z~2);" "29#false")
		 ("29#false" "~y~2 := ~x~2 + ~y~2;" "29#false")
		 ("29#false" "#res := 0;assume true;" "29#false")
		 ("29#false" "assume true;assume !(~y~2 >= 1);" "29#false")
		 ("29#false" "assume true;" "29#false")
		 ("29#false" "assume !true;" "29#false")
		 ("29#false" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "29#false")
		 ("29#false" "assume !true;" "29#false")
		 ("29#false" "assume true;" "29#false")
		 ("62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))" "#res := 0;assume true;" "62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))")
		 ("62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))" "assume true;" "62#(and (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 0))))")
	},
	returnTransitions = {
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "51#unseeded" "return;" "51#unseeded")
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "51#unseeded" "return;" "51#unseeded")
		 ("29#false" "51#unseeded" "return;" "29#false")
	}
);

NestedWordAutomaton buchiAutomatonIteration2 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "129#false" "169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "170#(<= main_~z~2 (+ main_~y~2 oldRank0))" "157#unseeded" },
	initialStates = {"157#unseeded" },
	finalStates = {"129#false" "169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" },
	callTransitions = {
		 ("157#unseeded" "call ULTIMATE.init();" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("157#unseeded" "call #t~ret3 := main();" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))")
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~x~2 + ~y~2;" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("129#false" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "129#false")
		 ("129#false" "assume true;assume !(~y~2 < ~z~2);" "129#false")
		 ("129#false" "~y~2 := ~x~2 + ~y~2;" "129#false")
		 ("129#false" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "129#false")
		 ("129#false" "assume !true;" "129#false")
		 ("169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))")
		 ("169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~z~2);" "170#(<= main_~z~2 (+ main_~y~2 oldRank0))")
		 ("169#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume !true;" "129#false")
	},
	returnTransitions = {
		 ("160#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "157#unseeded" "return;" "157#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration3 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "273#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "259#unseeded" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "278#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "218#false" },
	initialStates = {"259#unseeded" },
	finalStates = {"272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "218#false" },
	callTransitions = {
		 ("259#unseeded" "call ULTIMATE.init();" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("259#unseeded" "call #t~ret3 := main();" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "assume true;assume !(~y~2 < ~z~2);" "273#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "~y~2 := ~x~2 + ~y~2;" "278#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "assume !true;" "218#false")
		 ("273#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "~y~2 := ~x~2 + ~y~2;" "278#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("278#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "272#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
		 ("218#false" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "218#false")
		 ("218#false" "assume true;assume !(~y~2 < ~z~2);" "218#false")
		 ("218#false" "~y~2 := ~x~2 + ~y~2;" "218#false")
		 ("218#false" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "218#false")
		 ("218#false" "assume !true;" "218#false")
	},
	returnTransitions = {
		 ("262#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "259#unseeded" "return;" "259#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration4 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "513#false" "569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "570#(<= main_~z~2 (+ main_~y~2 oldRank0))" "557#unseeded" },
	initialStates = {"557#unseeded" },
	finalStates = {"513#false" "569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" },
	callTransitions = {
		 ("557#unseeded" "call ULTIMATE.init();" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("557#unseeded" "call #t~ret3 := main();" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~x~2 + ~y~2;" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !true;" "513#false")
		 ("513#false" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "513#false")
		 ("513#false" "assume true;assume !(~y~2 < ~z~2);" "513#false")
		 ("513#false" "~y~2 := ~x~2 + ~y~2;" "513#false")
		 ("513#false" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "513#false")
		 ("513#false" "assume !true;" "513#false")
		 ("569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))")
		 ("569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~z~2);" "570#(<= main_~z~2 (+ main_~y~2 oldRank0))")
		 ("569#(and (<= 0 oldRank0) (<= (+ main_~z~2 1) (+ main_~y~2 oldRank0)))" "assume !true;" "513#false")
	},
	returnTransitions = {
		 ("560#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "557#unseeded" "return;" "557#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration5 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"689#unseeded" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))" "710#(and (<= main_~y~2 oldRank0) (<= main_~z~2 oldRank0))" "701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "702#(<= main_~y~2 oldRank0)" "718#(<= main_~z~2 oldRank0)" },
	initialStates = {"689#unseeded" },
	finalStates = {"701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" },
	callTransitions = {
		 ("689#unseeded" "call ULTIMATE.init();" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("689#unseeded" "call #t~ret3 := main();" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~x~2 + ~y~2;" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))" "assume true;assume !(~y~2 < ~z~2);" "725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))")
		 ("725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))" "~y~2 := ~x~2 + ~y~2;" "718#(<= main_~z~2 oldRank0)")
		 ("710#(and (<= main_~y~2 oldRank0) (<= main_~z~2 oldRank0))" "~y~2 := ~x~2 + ~y~2;" "718#(<= main_~z~2 oldRank0)")
		 ("701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "702#(<= main_~y~2 oldRank0)")
		 ("701#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 < ~z~2);" "710#(and (<= main_~y~2 oldRank0) (<= main_~z~2 oldRank0))")
		 ("702#(<= main_~y~2 oldRank0)" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "702#(<= main_~y~2 oldRank0)")
		 ("702#(<= main_~y~2 oldRank0)" "assume true;assume !(~y~2 < ~z~2);" "710#(and (<= main_~y~2 oldRank0) (<= main_~z~2 oldRank0))")
		 ("718#(<= main_~z~2 oldRank0)" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "725#(and (<= 1 main_~y~2) (<= main_~z~2 oldRank0))")
	},
	returnTransitions = {
		 ("692#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "689#unseeded" "return;" "689#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration6 = (
	callAlphabet = {"call ULTIMATE.init();" "call #t~ret3 := main();" },
	internalAlphabet = {"assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "assume true;assume !(~y~2 < ~z~2);" "~y~2 := ~x~2 + ~y~2;" "assume true;assume !(~y~2 >= 1);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume !(((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" },
	returnAlphabet = {"return;" "return;" },
	states = {"1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "1096#unseeded" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" },
	initialStates = {"1096#unseeded" },
	finalStates = {"1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" },
	callTransitions = {
		 ("1096#unseeded" "call ULTIMATE.init();" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1096#unseeded" "call #t~ret3 := main();" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "assume true;assume !(~y~2 < ~z~2);" "1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))" "~y~2 := ~x~2 + ~y~2;" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1110#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "~y~2 := ~x~2 + ~y~2;" "1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~z~2);~x~2 := ~x~2 + 1;~z~2 := ~z~2 - 1;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~z~2);" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~x~2 + ~y~2;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;assume ((~x~2 <= 10000 && ~x~2 >= -10000) && ~y~2 <= 10000) && ~z~2 <= 10000;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1115#(and (>= oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (or (and (<= main_~y~2 oldRank1) (<= 1 main_~x~2) (<= 1 oldRank0) (<= main_~x~2 0)) (and (<= main_~y~2 oldRank1) (<= 0 oldRank0) (<= main_~x~2 0)) (and (<= 0 oldRank0) (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= main_~x~2 0)) (and (<= 1 main_~x~2) (<= main_~x~2 oldRank1) (<= 1 oldRank0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)))" "assume true;assume !!(~y~2 >= 1);~x~2 := ~x~2 - 1;" "1109#(or (and (> oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank0)) (and (> oldRank1 (ite (<= 1 main_~x~2) (+ main_~x~2 0) (+ main_~y~2 main_~x~2 0))) (>= oldRank0 (ite (<= 1 main_~x~2) 1 0)) (<= 0 oldRank1)))")
	},
	returnTransitions = {
		 ("1099#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1096#unseeded" "return;" "1096#unseeded")
	}
);


2019-05-11 07:09:08,087 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Timing statistics
2019-05-11 07:09:08,088 INFO  [BasicToolchainJob.java:95]:     BüchiAutomizer plugin needed 3.1s and 7 iterations. Analysis of lassos took 0.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization removed 27 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 5.	Nontrivial modules had stage [4, 0, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 5/10	InterpolantCoveringCapabilityBuchi: 0/1	EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 206 Sat,204 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.3s	LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks:   Termination: inital18 mio100 ax100 hnf102 lsp90 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100    Nontermination: inital18 mio100 ax100 hnf102 lsp90 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 
2019-05-11 07:09:08,088 INFO  [BasicToolchainJob.java:89]:   - TerminationAnalysisResult: Termination proven
2019-05-11 07:09:08,088 INFO  [BasicToolchainJob.java:95]:     Buchi Automizer proved that your program is terminating
2019-05-11 07:09:08,088 INFO  [BasicToolchainJob.java:75]:  * Results from UltimateCore:
2019-05-11 07:09:08,088 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Toolchain Benchmarks
2019-05-11 07:09:08,095 INFO  [BasicToolchainJob.java:95]:     Benchmark results are:
 * CDTParser took 115.95 ms. Allocated memory is still 643.3 MB. Free memory was 614.9 MB in the beginning and 608.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * CACSL2BoogieTranslator took 114.42 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 25.75 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
 * RCFGBuilder took 220.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB
 * BlockEncoding took 69.18 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 577.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB
 * TraceAbstraction took 102.47 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * BuchiAutomizer took 3128.08 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 367.6 MB in the end (delta: 202.9 MB). Peak memory consumption was 206.1 MB. Max. memory is 53.1 GB
2019-05-11 07:09:08,121 INFO  [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0
Closed successfully