YES

2019-05-11 07:09:41,299 INFO  [UltimateCore.java:185]: Initializing application
2019-05-11 07:09:41,302 INFO  [UltimateCore.java:202]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,306 INFO  [PluginFactory.java:62]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,306 INFO  [PluginFactory.java:63]: Detecting plugins...
2019-05-11 07:09:41,307 INFO  [PluginFactory.java:287]: 1 IController plugins available
2019-05-11 07:09:41,308 INFO  [PluginFactory.java:287]: 4 ISource plugins available
2019-05-11 07:09:41,308 INFO  [PluginFactory.java:287]: 1 IOutput plugins available
2019-05-11 07:09:41,308 INFO  [PluginFactory.java:287]: 10 IGenerator plugins available
2019-05-11 07:09:41,309 INFO  [PluginFactory.java:287]: 5 IAnalysis plugins available
2019-05-11 07:09:41,311 INFO  [PluginFactory.java:241]: Loaded  controller UltimateCore
2019-05-11 07:09:41,312 INFO  [PluginFactory.java:70]: Finished detecting plugins!
2019-05-11 07:09:41,312 INFO  [PluginFactory.java:71]: Loading services ...
2019-05-11 07:09:41,312 INFO  [PluginFactory.java:272]: 0 IServiceFactory services available
2019-05-11 07:09:41,312 INFO  [PluginFactory.java:73]: Finished loading services!
2019-05-11 07:09:41,313 INFO  [PluginFactory.java:74]: --------------------------------------------------------------------------------
2019-05-11 07:09:41,314 INFO  [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf
2019-05-11 07:09:43,114 INFO  [SettingsManager.java:54]: Loading preferences was successful
2019-05-11 07:09:43,115 INFO  [SettingsManager.java:55]: Preferences different from defaults:
2019-05-11 07:09:43,115 INFO  [PluginFactory.java:178]: --------------------------------------------------------------------------------
2019-05-11 07:09:43,115 INFO  [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences)
2019-05-11 07:09:43,468 INFO  [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible)
2019-05-11 07:09:43,468 INFO  [PluginFactory.java:198]: --------------------------------------------------------------------------------
2019-05-11 07:09:43,468 INFO  [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults:
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:63]:  * Only non-decreasing invariants=true
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:63]:  * Termination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:63]:  * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:63]:  * Nontermination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults:
2019-05-11 07:09:43,469 INFO  [SettingsManager.java:63]:  * Rating-Boundary (empty for LBE)=0
2019-05-11 07:09:43,470 INFO  [SettingsManager.java:63]:  * Strategy for the edge rating=DISJUNCTIVE_RATING
2019-05-11 07:09:43,470 INFO  [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults:
2019-05-11 07:09:43,470 INFO  [SettingsManager.java:63]:  * Lasso Analysis=Linear_with_guesses
2019-05-11 07:09:43,470 INFO  [SettingsManager.java:63]:  * Use external solver (rank synthesis)=false
2019-05-11 07:09:43,470 INFO  [SettingsManager.java:63]:  * Buchi interpolant automaton=StagedBlast
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:63]:  * Construct termination proof for TermComp=true
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults:
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:63]:  * Check unreachability of error function in SV-COMP mode=false
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:63]:  * Size of pointer (in bytes)=8
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:63]:  * Check if freed pointer was valid=false
2019-05-11 07:09:43,471 INFO  [SettingsManager.java:63]:  * How to treat unsigned ints differently from normal ones=IGNORE
2019-05-11 07:09:43,472 INFO  [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults:
2019-05-11 07:09:43,472 INFO  [SettingsManager.java:63]:  * Timeout in seconds=100000
2019-05-11 07:09:43,472 INFO  [SettingsManager.java:63]:  * The redirection strategy for Impulse=RANDOmSTRONGEST
2019-05-11 07:09:43,472 INFO  [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults:
2019-05-11 07:09:43,472 INFO  [SettingsManager.java:63]:  * Size of a code block=SequenceOfStatements
2019-05-11 07:09:43,473 INFO  [SettingsManager.java:63]:  * Convert code blocks to CNF=false
2019-05-11 07:09:43,473 INFO  [SettingsManager.java:63]:  * To the following directory=/home/matthias/ultimate/dump
2019-05-11 07:09:43,473 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,473 INFO  [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults:
2019-05-11 07:09:43,473 INFO  [SettingsManager.java:63]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
2019-05-11 07:09:43,473 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:43,474 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:43,474 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:43,474 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:43,474 INFO  [UltimateCore.java:76]: Initializing controller ...
2019-05-11 07:09:43,689 INFO  [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp
2019-05-11 07:09:43,696 INFO  [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:43,696 INFO  [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated...
2019-05-11 07:09:43,698 INFO  [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected.
2019-05-11 07:09:43,700 INFO  [PluginConnector.java:252]: Initializing CDTParser...
2019-05-11 07:09:43,700 INFO  [PluginConnector.java:257]: CDTParser initialized
2019-05-11 07:09:43,700 INFO  [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:43,821 INFO  [ToolchainManager.java:238]: ####################### [Toolchain 1] #######################
2019-05-11 07:09:43,823 INFO  [ToolchainWalker.java:61]: Walking toolchain with 6 elements.
2019-05-11 07:09:43,823 INFO  [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:43,823 INFO  [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator...
2019-05-11 07:09:43,827 INFO  [PluginConnector.java:257]: CACSL2BoogieTranslator initialized
2019-05-11 07:09:43,827 INFO  [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:43" (1/1) ...
2019-05-11 07:09:43,934 INFO  [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:43,934 INFO  [PluginConnector.java:90]: ------------------------Boogie Preprocessor----------------------------
2019-05-11 07:09:43,934 INFO  [PluginConnector.java:252]: Initializing Boogie Preprocessor...
2019-05-11 07:09:43,934 INFO  [PluginConnector.java:257]: Boogie Preprocessor initialized
2019-05-11 07:09:43,950 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:43" (1/1) ...
2019-05-11 07:09:43,955 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:43" (1/1) ...
2019-05-11 07:09:43,955 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:43" (1/1) ...
2019-05-11 07:09:43,956 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:43" (1/1) ...
2019-05-11 07:09:43,958 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:43" (1/1) ...
2019-05-11 07:09:43,958 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:43" (1/1) ...
2019-05-11 07:09:43,960 INFO  [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor----------------------------
2019-05-11 07:09:43,960 INFO  [PluginConnector.java:90]: ------------------------RCFGBuilder----------------------------
2019-05-11 07:09:43,960 INFO  [PluginConnector.java:252]: Initializing RCFGBuilder...
2019-05-11 07:09:43,960 INFO  [PluginConnector.java:257]: RCFGBuilder initialized
2019-05-11 07:09:43,962 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:43" (1/1) ...
2019-05-11 07:09:44,059 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,061 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,168 INFO  [PluginConnector.java:110]: ------------------------ END RCFGBuilder----------------------------
2019-05-11 07:09:44,168 INFO  [PluginConnector.java:90]: ------------------------BlockEncoding----------------------------
2019-05-11 07:09:44,168 INFO  [PluginConnector.java:252]: Initializing BlockEncoding...
2019-05-11 07:09:44,170 INFO  [PluginConnector.java:257]: BlockEncoding initialized
2019-05-11 07:09:44,170 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,183 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,197 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:44,199 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:44,219 INFO  [PluginConnector.java:110]: ------------------------ END BlockEncoding----------------------------
2019-05-11 07:09:44,219 INFO  [PluginConnector.java:90]: ------------------------TraceAbstraction----------------------------
2019-05-11 07:09:44,219 INFO  [PluginConnector.java:252]: Initializing TraceAbstraction...
2019-05-11 07:09:44,221 INFO  [PluginConnector.java:257]: TraceAbstraction initialized
2019-05-11 07:09:44,221 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:44" (1/5) ...
2019-05-11 07:09:44,222 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:43" (2/5) ...
2019-05-11 07:09:44,222 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" (3/5) ...
2019-05-11 07:09:44,223 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" (4/5) ...
2019-05-11 07:09:44,223 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:43" (5/5) ...
Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
2019-05-11 07:09:44,316 INFO  [PluginConnector.java:110]: ------------------------ END TraceAbstraction----------------------------
2019-05-11 07:09:44,316 INFO  [PluginConnector.java:90]: ------------------------BuchiAutomizer----------------------------
2019-05-11 07:09:44,316 INFO  [PluginConnector.java:252]: Initializing BuchiAutomizer...
2019-05-11 07:09:44,317 INFO  [PluginConnector.java:257]: BuchiAutomizer initialized
2019-05-11 07:09:44,319 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:44" (1/1) ...
2019-05-11 07:09:49,488 INFO  [PluginConnector.java:110]: ------------------------ END BuchiAutomizer----------------------------
2019-05-11 07:09:49,491 INFO  [Benchmark.java:150]: Toolchain (without parser) took 5668.94 ms. Allocated memory was 649.6 MB in the beginning and 776.5 MB in the end (delta: 126.9 MB). Free memory was 610.2 MB in the beginning and 683.4 MB in the end (delta: -73.3 MB). Peak memory consumption was 53.6 MB. Max. memory is 53.1 GB
2019-05-11 07:09:49,493 INFO  [Benchmark.java:150]: CDTParser took 109.85 ms. Allocated memory is still 649.6 MB. Free memory was 618.2 MB in the beginning and 611.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:49,494 INFO  [Benchmark.java:150]: CACSL2BoogieTranslator took 110.69 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.1 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:49,495 INFO  [Benchmark.java:150]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 649.6 MB. Free memory was 606.1 MB in the beginning and 604.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:49,496 INFO  [Benchmark.java:150]: RCFGBuilder took 208.26 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 53.1 GB
2019-05-11 07:09:49,497 INFO  [Benchmark.java:150]: BlockEncoding took 50.80 ms. Allocated memory is still 649.6 MB. Free memory was 589.6 MB in the beginning and 585.5 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:49,498 INFO  [Benchmark.java:150]: TraceAbstraction took 96.78 ms. Allocated memory is still 649.6 MB. Free memory was 585.5 MB in the beginning and 578.8 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:49,498 INFO  [Benchmark.java:150]: BuchiAutomizer took 5173.58 ms. Allocated memory was 649.6 MB in the beginning and 776.5 MB in the end (delta: 126.9 MB). Free memory was 578.8 MB in the beginning and 683.4 MB in the end (delta: -104.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 53.1 GB
2019-05-11 07:09:49,505 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:49,505 INFO  [ToolchainManager.java:286]: #######################  End [Toolchain 1] #######################
2019-05-11 07:09:49,505 INFO  [BasicToolchainJob.java:73]:  --- Results ---
2019-05-11 07:09:49,506 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
2019-05-11 07:09:49,506 INFO  [BasicToolchainJob.java:89]:   - AllSpecificationsHoldResult: All specifications hold
2019-05-11 07:09:49,506 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:49,506 INFO  [BasicToolchainJob.java:89]:   - ProcedureContractResult [Line: 5]: Procedure Contract for main
2019-05-11 07:09:49,506 INFO  [BasicToolchainJob.java:95]:     Derived contract for procedure main: 1
2019-05-11 07:09:49,506 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 11]: Loop Invariant
2019-05-11 07:09:49,507 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:09:49,507 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Ultimate Automizer benchmark data
2019-05-11 07:09:49,507 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:49,507 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
2019-05-11 07:09:49,507 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed decomposition of program
2019-05-11 07:09:49,507 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into 12 terminating modules (4 trivial, 3 deterministic, 5 nondeterministic). One deterministic module has affine ranking function -2 * x + 211 and consists of 5 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * x + 221 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 4 locations. One nondeterministic module has affine ranking function x + 0 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 5 locations. One nondeterministic module has affine ranking function c + 0 and consists of 9 locations. One nondeterministic module has affine ranking function c + 0 and consists of 10 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations.
2019-05-11 07:09:49,508 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed termination proof in form of nested word automata
2019-05-11 07:09:49,508 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into the following automata 
NestedWordAutomaton finiteAutomatonIteration2 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "194#unseeded" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"194#unseeded" },
	finalStates = {"209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("194#unseeded" "call #t~ret1 := main();" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("194#unseeded" "call ULTIMATE.init();" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "194#unseeded" "return;" "194#unseeded")
	}
);

NestedWordAutomaton finiteAutomatonIteration3 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "670#unseeded" },
	initialStates = {"670#unseeded" },
	finalStates = {"689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("670#unseeded" "call #t~ret1 := main();" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("670#unseeded" "call ULTIMATE.init();" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
	},
	returnTransitions = {
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "670#unseeded" "return;" "670#unseeded")
	}
);

NestedWordAutomaton finiteAutomatonIteration8 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6087#(<= main_~c~2 oldRank0)" "6073#unseeded" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" },
	initialStates = {"6073#unseeded" },
	finalStates = {"6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" },
	callTransitions = {
		 ("6073#unseeded" "call #t~ret1 := main();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6073#unseeded" "call ULTIMATE.init();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume !!(~c~2 > 0);" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))")
		 ("6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume !!(~c~2 > 0);" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))")
		 ("6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6073#unseeded" "return;" "6073#unseeded")
	}
);

NestedWordAutomaton finiteAutomatonIteration9 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6087#(<= main_~c~2 oldRank0)" "6073#unseeded" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" },
	initialStates = {"6073#unseeded" },
	finalStates = {"6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" },
	callTransitions = {
		 ("6073#unseeded" "call #t~ret1 := main();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6073#unseeded" "call ULTIMATE.init();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume !!(~c~2 > 0);" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))")
		 ("6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume !!(~c~2 > 0);" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))")
		 ("6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6073#unseeded" "return;" "6073#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration1 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"51#unseeded" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "26#false" "60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" },
	initialStates = {"51#unseeded" },
	finalStates = {"26#false" "60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("51#unseeded" "call #t~ret1 := main();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("51#unseeded" "call ULTIMATE.init();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("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)|))))")
		 ("26#false" "assume true;" "26#false")
		 ("26#false" "#res := 0;assume true;" "26#false")
		 ("60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume !true;" "26#false")
		 ("60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "60#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~c~2 > 0);" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !true;" "26#false")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "#res := 0;assume true;" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("61#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "61#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
	},
	returnTransitions = {
		 ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "51#unseeded" "return;" "51#unseeded")
		 ("26#false" "51#unseeded" "return;" "26#false")
	}
);

NestedWordAutomaton buchiAutomatonIteration2 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "194#unseeded" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"194#unseeded" },
	finalStates = {"209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("194#unseeded" "call #t~ret1 := main();" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("194#unseeded" "call ULTIMATE.init();" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("210#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "210#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "209#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("197#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "194#unseeded" "return;" "194#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration3 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "670#unseeded" },
	initialStates = {"670#unseeded" },
	finalStates = {"689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("670#unseeded" "call #t~ret1 := main();" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("670#unseeded" "call ULTIMATE.init();" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "689#(and (<= 0 oldRank0) (<= 212 (+ (* 2 main_~x~2) oldRank0)))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
		 ("690#(<= 211 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "690#(<= 211 (+ (* 2 main_~x~2) oldRank0))")
	},
	returnTransitions = {
		 ("673#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "670#unseeded" "return;" "670#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration4 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "1301#(<= main_~x~2 oldRank0)" "1287#unseeded" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"1287#unseeded" },
	finalStates = {"1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" },
	callTransitions = {
		 ("1287#unseeded" "call #t~ret1 := main();" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1287#unseeded" "call ULTIMATE.init();" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1301#(<= main_~x~2 oldRank0)")
		 ("1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1301#(<= main_~x~2 oldRank0)")
		 ("1301#(<= main_~x~2 oldRank0)" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("1301#(<= main_~x~2 oldRank0)" "assume true;" "1301#(<= main_~x~2 oldRank0)")
		 ("1301#(<= main_~x~2 oldRank0)" "assume !!(~c~2 > 0);" "1301#(<= main_~x~2 oldRank0)")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1300#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("1290#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1287#unseeded" "return;" "1287#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration5 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"1520#unseeded" "1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))" },
	initialStates = {"1520#unseeded" },
	finalStates = {"1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("1520#unseeded" "call #t~ret1 := main();" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1520#unseeded" "call ULTIMATE.init();" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))" "assume true;" "1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))")
		 ("1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))" "assume true;" "1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))")
		 ("1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))" "assume !!(~c~2 > 0);" "1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "1533#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "1552#(exists ((v_main_~x~2_62 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_62) oldRank0)) (<= v_main_~x~2_62 (+ main_~x~2 10))))")
		 ("1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "1534#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
	},
	returnTransitions = {
		 ("1523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1520#unseeded" "return;" "1520#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration6 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "2332#unseeded" "2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"2332#unseeded" },
	finalStates = {"2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" },
	callTransitions = {
		 ("2332#unseeded" "call #t~ret1 := main();" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2332#unseeded" "call ULTIMATE.init();" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))" "assume true;" "2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))")
		 ("2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume true;" "2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))" "assume !!(~c~2 > 0);" "2346#(<= 221 (+ (* 2 main_~x~2) oldRank0))")
		 ("2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))" "assume true;" "2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))")
		 ("2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))" "assume true;" "2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))")
		 ("2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))" "assume !!(~c~2 > 0);" "2364#(exists ((v_main_~x~2_89 Int)) (and (<= 221 (+ (* 2 v_main_~x~2_89) oldRank0)) (<= v_main_~x~2_89 (+ main_~x~2 10))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2345#(and (<= 0 oldRank0) (<= 222 (+ (* 2 main_~x~2) oldRank0)))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("2335#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2332#unseeded" "return;" "2332#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration7 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "3762#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 1 main_~c~2) (<= 3 oldRank0))" "3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "3531#(<= main_~c~2 oldRank0)" "3819#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))" "3517#unseeded" "3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "3806#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))" "3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" },
	initialStates = {"3517#unseeded" },
	finalStates = {"3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" },
	callTransitions = {
		 ("3517#unseeded" "call #t~ret1 := main();" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3517#unseeded" "call ULTIMATE.init();" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("3762#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 1 main_~c~2) (<= 3 oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "3819#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))")
		 ("3762#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 1 main_~c~2) (<= 3 oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "3806#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))")
		 ("3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "3531#(<= main_~c~2 oldRank0)")
		 ("3531#(<= main_~c~2 oldRank0)" "assume true;" "3531#(<= main_~c~2 oldRank0)")
		 ("3531#(<= main_~c~2 oldRank0)" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3531#(<= main_~c~2 oldRank0)" "assume true;" "3531#(<= main_~c~2 oldRank0)")
		 ("3531#(<= main_~c~2 oldRank0)" "assume !!(~c~2 > 0);" "3531#(<= main_~c~2 oldRank0)")
		 ("3819#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))" "assume true;" "3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "3531#(<= main_~c~2 oldRank0)")
		 ("3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "3549#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3806#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 3 oldRank0))" "assume true;" "3530#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("3663#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "3762#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 1 main_~c~2) (<= 3 oldRank0))")
	},
	returnTransitions = {
		 ("3520#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "3517#unseeded" "return;" "3517#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration8 = (
	callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "assume !(~c~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~c~2 > 0);" },
	returnAlphabet = {"return;" "return;" },
	states = {"6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6087#(<= main_~c~2 oldRank0)" "6073#unseeded" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" },
	initialStates = {"6073#unseeded" },
	finalStates = {"6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" },
	callTransitions = {
		 ("6073#unseeded" "call #t~ret1 := main();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6073#unseeded" "call ULTIMATE.init();" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume true;" "6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))")
		 ("6421#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0))" "assume !!(~c~2 > 0);" "6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))")
		 ("6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6087#(<= main_~c~2 oldRank0)" "assume true;" "6087#(<= main_~c~2 oldRank0)")
		 ("6087#(<= main_~c~2 oldRank0)" "assume !!(~c~2 > 0);" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6087#(<= main_~c~2 oldRank0)")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6225#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume true;" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))" "assume !!(~c~2 > 0);" "6106#(and (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~c~2;~x~2 := #t~nondet0;havoc #t~nondet0;~c~2 := 1;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~c~2 > 0);" "6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume !(~x~2 > 100);~x~2 := ~x~2 + 11;~c~2 := ~c~2 + 1;" "6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))")
		 ("6716#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 1 main_~c~2) (<= 4 oldRank0))" "assume ~x~2 > 100;~x~2 := ~x~2 - 10;~c~2 := ~c~2 - 1;" "6900#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= (+ main_~c~2 3) oldRank0) (<= 4 oldRank0))")
		 ("6895#(and (<= (+ main_~c~2 2) oldRank0) (<= main_~c~2 oldRank0) (<= (+ main_~c~2 1) oldRank0) (<= 4 oldRank0))" "assume true;" "6086#(and (<= 0 oldRank0) (<= (+ main_~c~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("6076#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "6073#unseeded" "return;" "6073#unseeded")
	}
);


2019-05-11 07:09:49,511 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Timing statistics
2019-05-11 07:09:49,512 INFO  [BasicToolchainJob.java:95]:     BüchiAutomizer plugin needed 5.1s and 10 iterations. Analysis of lassos took 1.0s. Construction of modules took 0.8s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization removed 3995 states and took 0.1s. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 444 states and ocurred in iteration 8.	Nontrivial modules had stage [3, 0, 3, 2, 0].	InterpolantCoveringCapabilityFinite: 121/124	InterpolantCoveringCapabilityBuchi: 36/44	EdgeCheckerBenchmarkData: HoareTripleChecks: 58 SDtfs, 1 SDslu, 74 SDs, 0 lazy, 929 Sat,609 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.8s	LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks:   Termination: inital19 mio100 ax100 hnf98 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100    Nontermination: inital19 mio100 ax100 hnf98 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 
2019-05-11 07:09:49,512 INFO  [BasicToolchainJob.java:89]:   - TerminationAnalysisResult: Termination proven
2019-05-11 07:09:49,512 INFO  [BasicToolchainJob.java:95]:     Buchi Automizer proved that your program is terminating
2019-05-11 07:09:49,512 INFO  [BasicToolchainJob.java:75]:  * Results from UltimateCore:
2019-05-11 07:09:49,512 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Toolchain Benchmarks
2019-05-11 07:09:49,518 INFO  [BasicToolchainJob.java:95]:     Benchmark results are:
 * CDTParser took 109.85 ms. Allocated memory is still 649.6 MB. Free memory was 618.2 MB in the beginning and 611.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * CACSL2BoogieTranslator took 110.69 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB
 * Boogie Preprocessor took 25.55 ms. Allocated memory is still 649.6 MB. Free memory was 606.1 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
 * RCFGBuilder took 208.26 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 53.1 GB
 * BlockEncoding took 50.80 ms. Allocated memory is still 649.6 MB. Free memory was 589.6 MB in the beginning and 585.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB
 * TraceAbstraction took 96.78 ms. Allocated memory is still 649.6 MB. Free memory was 585.5 MB in the beginning and 578.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * BuchiAutomizer took 5173.58 ms. Allocated memory was 649.6 MB in the beginning and 776.5 MB in the end (delta: 126.9 MB). Free memory was 578.8 MB in the beginning and 683.4 MB in the end (delta: -104.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 53.1 GB
2019-05-11 07:09:49,545 INFO  [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0
Closed successfully