YES

2019-05-11 07:10:23,226 INFO  [UltimateCore.java:185]: Initializing application
2019-05-11 07:10:23,229 INFO  [UltimateCore.java:202]: --------------------------------------------------------------------------------
2019-05-11 07:10:23,233 INFO  [PluginFactory.java:62]: --------------------------------------------------------------------------------
2019-05-11 07:10:23,233 INFO  [PluginFactory.java:63]: Detecting plugins...
2019-05-11 07:10:23,234 INFO  [PluginFactory.java:287]: 1 IController plugins available
2019-05-11 07:10:23,235 INFO  [PluginFactory.java:287]: 4 ISource plugins available
2019-05-11 07:10:23,235 INFO  [PluginFactory.java:287]: 1 IOutput plugins available
2019-05-11 07:10:23,235 INFO  [PluginFactory.java:287]: 10 IGenerator plugins available
2019-05-11 07:10:23,236 INFO  [PluginFactory.java:287]: 5 IAnalysis plugins available
2019-05-11 07:10:23,238 INFO  [PluginFactory.java:241]: Loaded  controller UltimateCore
2019-05-11 07:10:23,239 INFO  [PluginFactory.java:70]: Finished detecting plugins!
2019-05-11 07:10:23,239 INFO  [PluginFactory.java:71]: Loading services ...
2019-05-11 07:10:23,239 INFO  [PluginFactory.java:272]: 0 IServiceFactory services available
2019-05-11 07:10:23,239 INFO  [PluginFactory.java:73]: Finished loading services!
2019-05-11 07:10:23,240 INFO  [PluginFactory.java:74]: --------------------------------------------------------------------------------
2019-05-11 07:10:23,241 INFO  [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf
2019-05-11 07:10:24,590 INFO  [SettingsManager.java:54]: Loading preferences was successful
2019-05-11 07:10:24,591 INFO  [SettingsManager.java:55]: Preferences different from defaults:
2019-05-11 07:10:24,591 INFO  [PluginFactory.java:178]: --------------------------------------------------------------------------------
2019-05-11 07:10:24,591 INFO  [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences)
2019-05-11 07:10:24,950 INFO  [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible)
2019-05-11 07:10:24,950 INFO  [PluginFactory.java:198]: --------------------------------------------------------------------------------
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults:
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:63]:  * Only non-decreasing invariants=true
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:63]:  * Termination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:63]:  * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:63]:  * Nontermination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:10:24,951 INFO  [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults:
2019-05-11 07:10:24,952 INFO  [SettingsManager.java:63]:  * Rating-Boundary (empty for LBE)=0
2019-05-11 07:10:24,952 INFO  [SettingsManager.java:63]:  * Strategy for the edge rating=DISJUNCTIVE_RATING
2019-05-11 07:10:24,952 INFO  [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults:
2019-05-11 07:10:24,952 INFO  [SettingsManager.java:63]:  * Lasso Analysis=Linear_with_guesses
2019-05-11 07:10:24,952 INFO  [SettingsManager.java:63]:  * Use external solver (rank synthesis)=false
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:63]:  * Buchi interpolant automaton=StagedBlast
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:63]:  * Construct termination proof for TermComp=true
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults:
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:63]:  * Check unreachability of error function in SV-COMP mode=false
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:63]:  * Size of pointer (in bytes)=8
2019-05-11 07:10:24,953 INFO  [SettingsManager.java:63]:  * Check if freed pointer was valid=false
2019-05-11 07:10:24,954 INFO  [SettingsManager.java:63]:  * How to treat unsigned ints differently from normal ones=IGNORE
2019-05-11 07:10:24,954 INFO  [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults:
2019-05-11 07:10:24,954 INFO  [SettingsManager.java:63]:  * Timeout in seconds=100000
2019-05-11 07:10:24,954 INFO  [SettingsManager.java:63]:  * The redirection strategy for Impulse=RANDOmSTRONGEST
2019-05-11 07:10:24,954 INFO  [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults:
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:63]:  * Size of a code block=SequenceOfStatements
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:63]:  * Convert code blocks to CNF=false
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:63]:  * To the following directory=/home/matthias/ultimate/dump
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:63]:  * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults:
2019-05-11 07:10:24,955 INFO  [SettingsManager.java:63]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
2019-05-11 07:10:24,956 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:10:24,956 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:10:24,956 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:10:24,956 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:10:24,957 INFO  [UltimateCore.java:76]: Initializing controller ...
2019-05-11 07:10:25,169 INFO  [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp
2019-05-11 07:10:25,175 INFO  [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c
2019-05-11 07:10:25,175 INFO  [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated...
2019-05-11 07:10:25,179 INFO  [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected.
2019-05-11 07:10:25,180 INFO  [PluginConnector.java:252]: Initializing CDTParser...
2019-05-11 07:10:25,180 INFO  [PluginConnector.java:257]: CDTParser initialized
2019-05-11 07:10:25,181 INFO  [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c
2019-05-11 07:10:25,301 INFO  [ToolchainManager.java:238]: ####################### [Toolchain 1] #######################
2019-05-11 07:10:25,303 INFO  [ToolchainWalker.java:61]: Walking toolchain with 6 elements.
2019-05-11 07:10:25,303 INFO  [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator----------------------------
2019-05-11 07:10:25,303 INFO  [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator...
2019-05-11 07:10:25,307 INFO  [PluginConnector.java:257]: CACSL2BoogieTranslator initialized
2019-05-11 07:10:25,308 INFO  [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:25" (1/1) ...
2019-05-11 07:10:25,414 INFO  [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator----------------------------
2019-05-11 07:10:25,415 INFO  [PluginConnector.java:90]: ------------------------Boogie Preprocessor----------------------------
2019-05-11 07:10:25,415 INFO  [PluginConnector.java:252]: Initializing Boogie Preprocessor...
2019-05-11 07:10:25,415 INFO  [PluginConnector.java:257]: Boogie Preprocessor initialized
2019-05-11 07:10:25,430 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:10:25" (1/1) ...
2019-05-11 07:10:25,435 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:10:25" (1/1) ...
2019-05-11 07:10:25,435 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:10:25" (1/1) ...
2019-05-11 07:10:25,437 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:10:25" (1/1) ...
2019-05-11 07:10:25,438 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:10:25" (1/1) ...
2019-05-11 07:10:25,439 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:10:25" (1/1) ...
2019-05-11 07:10:25,440 INFO  [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor----------------------------
2019-05-11 07:10:25,440 INFO  [PluginConnector.java:90]: ------------------------RCFGBuilder----------------------------
2019-05-11 07:10:25,440 INFO  [PluginConnector.java:252]: Initializing RCFGBuilder...
2019-05-11 07:10:25,441 INFO  [PluginConnector.java:257]: RCFGBuilder initialized
2019-05-11 07:10:25,442 INFO  [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:25" (1/1) ...
2019-05-11 07:10:25,537 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:10:25,539 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:10:25,649 INFO  [PluginConnector.java:110]: ------------------------ END RCFGBuilder----------------------------
2019-05-11 07:10:25,650 INFO  [PluginConnector.java:90]: ------------------------BlockEncoding----------------------------
2019-05-11 07:10:25,650 INFO  [PluginConnector.java:252]: Initializing BlockEncoding...
2019-05-11 07:10:25,651 INFO  [PluginConnector.java:257]: BlockEncoding initialized
2019-05-11 07:10:25,651 INFO  [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:25" (1/1) ...
2019-05-11 07:10:25,665 INFO  [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:25" (1/1) ...
2019-05-11 07:10:25,680 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:10:25,681 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:10:25,711 INFO  [PluginConnector.java:110]: ------------------------ END BlockEncoding----------------------------
2019-05-11 07:10:25,711 INFO  [PluginConnector.java:90]: ------------------------TraceAbstraction----------------------------
2019-05-11 07:10:25,711 INFO  [PluginConnector.java:252]: Initializing TraceAbstraction...
2019-05-11 07:10:25,712 INFO  [PluginConnector.java:257]: TraceAbstraction initialized
2019-05-11 07:10:25,712 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:25" (1/5) ...
2019-05-11 07:10:25,713 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:25" (2/5) ...
2019-05-11 07:10:25,714 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:25" (3/5) ...
2019-05-11 07:10:25,714 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:10:25" (4/5) ...
2019-05-11 07:10:25,715 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:25" (5/5) ...
Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
2019-05-11 07:10:25,809 INFO  [PluginConnector.java:110]: ------------------------ END TraceAbstraction----------------------------
2019-05-11 07:10:25,810 INFO  [PluginConnector.java:90]: ------------------------BuchiAutomizer----------------------------
2019-05-11 07:10:25,810 INFO  [PluginConnector.java:252]: Initializing BuchiAutomizer...
2019-05-11 07:10:25,810 INFO  [PluginConnector.java:257]: BuchiAutomizer initialized
2019-05-11 07:10:25,812 INFO  [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:10:25" (1/1) ...
2019-05-11 07:10:28,610 INFO  [PluginConnector.java:110]: ------------------------ END BuchiAutomizer----------------------------
2019-05-11 07:10:28,611 INFO  [Benchmark.java:150]: Toolchain (without parser) took 3308.85 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 604.2 MB in the beginning and 370.8 MB in the end (delta: 233.4 MB). Peak memory consumption was 236.6 MB. Max. memory is 53.1 GB
2019-05-11 07:10:28,613 INFO  [Benchmark.java:150]: CDTParser took 109.78 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.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:10:28,614 INFO  [Benchmark.java:150]: CACSL2BoogieTranslator took 111.26 ms. Allocated memory is still 643.3 MB. Free memory was 604.2 MB in the beginning and 600.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:10:28,615 INFO  [Benchmark.java:150]: Boogie Preprocessor took 25.41 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
2019-05-11 07:10:28,616 INFO  [Benchmark.java:150]: RCFGBuilder took 208.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 582.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB
2019-05-11 07:10:28,616 INFO  [Benchmark.java:150]: BlockEncoding took 61.29 ms. Allocated memory is still 643.3 MB. Free memory was 582.6 MB in the beginning and 578.6 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:10:28,617 INFO  [Benchmark.java:150]: TraceAbstraction took 98.37 ms. Allocated memory is still 643.3 MB. Free memory was 578.6 MB in the beginning and 571.9 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:10:28,618 INFO  [Benchmark.java:150]: BuchiAutomizer took 2800.31 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 571.9 MB in the beginning and 370.8 MB in the end (delta: 201.1 MB). Peak memory consumption was 204.3 MB. Max. memory is 53.1 GB
2019-05-11 07:10:28,626 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:10:28,626 INFO  [ToolchainManager.java:286]: #######################  End [Toolchain 1] #######################
2019-05-11 07:10:28,626 INFO  [BasicToolchainJob.java:73]:  --- Results ---
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:89]:   - AllSpecificationsHoldResult: All specifications hold
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:95]:     We were not able to verify any specifiation because the program does not contain any specification.
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:89]:   - ProcedureContractResult [Line: 17]: Procedure Contract for main
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:95]:     Derived contract for procedure main: 1
2019-05-11 07:10:28,627 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 22]: Loop Invariant
2019-05-11 07:10:28,628 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:10:28,628 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Ultimate Automizer benchmark data
2019-05-11 07:10:28,628 INFO  [BasicToolchainJob.java:95]:     CFG has 14 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 14 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:10:28,628 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
2019-05-11 07:10:28,628 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed decomposition of program
2019-05-11 07:10:28,629 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function q + 0 and consists of 6 locations. One deterministic module has affine ranking function p + 0 and consists of 5 locations. One deterministic module has affine ranking function q + 0 and consists of 5 locations. One deterministic module has affine ranking function p + 0 and consists of 6 locations. One nondeterministic module has affine ranking function p + 0 and consists of 5 locations. One nondeterministic module has affine ranking function q + 0 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations.
2019-05-11 07:10:28,629 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed termination proof in form of nested word automata
2019-05-11 07:10:28,629 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into the following automata 
NestedWordAutomaton finiteAutomatonIteration2 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"53#unseeded" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "63#(<= main_~q~2 oldRank0)" },
	initialStates = {"53#unseeded" },
	finalStates = {"27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" },
	callTransitions = {
		 ("53#unseeded" "call #t~ret4 := main();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("53#unseeded" "call ULTIMATE.init();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~p~2 < ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !true;" "27#false")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "#res := 0;assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("27#false" "assume true;" "27#false")
		 ("27#false" "#res := 0;assume true;" "27#false")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume !true;" "27#false")
		 ("63#(<= main_~q~2 oldRank0)" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("63#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("63#(<= main_~q~2 oldRank0)" "assume !true;" "27#false")
		 ("63#(<= main_~q~2 oldRank0)" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "63#(<= main_~q~2 oldRank0)")
		 ("63#(<= main_~q~2 oldRank0)" "#res := 0;assume true;" "63#(<= main_~q~2 oldRank0)")
	},
	returnTransitions = {
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "53#unseeded" "return;" "53#unseeded")
		 ("27#false" "53#unseeded" "return;" "27#false")
	}
);

NestedWordAutomaton buchiAutomatonIteration1 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"53#unseeded" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "63#(<= main_~q~2 oldRank0)" },
	initialStates = {"53#unseeded" },
	finalStates = {"27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" },
	callTransitions = {
		 ("53#unseeded" "call #t~ret4 := main();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("53#unseeded" "call ULTIMATE.init();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~p~2 < ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !true;" "27#false")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "#res := 0;assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("27#false" "assume true;" "27#false")
		 ("27#false" "#res := 0;assume true;" "27#false")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume !true;" "27#false")
		 ("63#(<= main_~q~2 oldRank0)" "assume true;" "63#(<= main_~q~2 oldRank0)")
		 ("63#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("63#(<= main_~q~2 oldRank0)" "assume !true;" "27#false")
		 ("63#(<= main_~q~2 oldRank0)" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "63#(<= main_~q~2 oldRank0)")
		 ("63#(<= main_~q~2 oldRank0)" "#res := 0;assume true;" "63#(<= main_~q~2 oldRank0)")
	},
	returnTransitions = {
		 ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "53#unseeded" "return;" "53#unseeded")
		 ("27#false" "53#unseeded" "return;" "27#false")
	}
);

NestedWordAutomaton buchiAutomatonIteration3 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "258#(<= main_~p~2 oldRank0)" "243#unseeded" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" },
	initialStates = {"243#unseeded" },
	finalStates = {"257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" },
	callTransitions = {
		 ("243#unseeded" "call #t~ret4 := main();" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("243#unseeded" "call ULTIMATE.init();" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume !(~q~2 < ~p~2);" "258#(<= main_~p~2 oldRank0)")
		 ("257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("258#(<= main_~p~2 oldRank0)" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "257#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "262#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
	},
	returnTransitions = {
		 ("246#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "243#unseeded" "return;" "243#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration4 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"392#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "377#unseeded" "393#(<= main_~q~2 oldRank0)" "409#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"377#unseeded" },
	finalStates = {"392#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" },
	callTransitions = {
		 ("377#unseeded" "call #t~ret4 := main();" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("377#unseeded" "call ULTIMATE.init();" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("392#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "393#(<= main_~q~2 oldRank0)")
		 ("393#(<= main_~q~2 oldRank0)" "assume true;" "393#(<= main_~q~2 oldRank0)")
		 ("393#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "409#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("409#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "409#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("409#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "392#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "392#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("380#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "377#unseeded" "return;" "377#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration5 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "893#(<= main_~p~2 oldRank0)" "878#unseeded" },
	initialStates = {"878#unseeded" },
	finalStates = {"892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" },
	callTransitions = {
		 ("878#unseeded" "call #t~ret4 := main();" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("878#unseeded" "call ULTIMATE.init();" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume !(~q~2 < ~p~2);" "893#(<= main_~p~2 oldRank0)")
		 ("892#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("893#(<= main_~p~2 oldRank0)" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "897#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
	},
	returnTransitions = {
		 ("881#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "878#unseeded" "return;" "878#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration6 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"1250#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "1236#unseeded" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "1303#(and (<= (+ main_~q~2 3) oldRank0) (distinct main_~p~2 main_~q~2) (<= 1 main_~q~2))" "1278#(<= (+ main_~q~2 3) oldRank0)" },
	initialStates = {"1236#unseeded" },
	finalStates = {"1250#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" },
	callTransitions = {
		 ("1236#unseeded" "call #t~ret4 := main();" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1236#unseeded" "call ULTIMATE.init();" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1250#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "1250#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume !(~q~2 < ~p~2);" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume true;" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))")
		 ("1255#(and (<= (+ main_~p~2 1) oldRank0) (<= main_~p~2 oldRank0))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1278#(<= (+ main_~q~2 3) oldRank0)")
		 ("1303#(and (<= (+ main_~q~2 3) oldRank0) (distinct main_~p~2 main_~q~2) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "1250#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))")
		 ("1303#(and (<= (+ main_~q~2 3) oldRank0) (distinct main_~p~2 main_~q~2) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1278#(<= (+ main_~q~2 3) oldRank0)")
		 ("1278#(<= (+ main_~q~2 3) oldRank0)" "assume true;" "1278#(<= (+ main_~q~2 3) oldRank0)")
		 ("1278#(<= (+ main_~q~2 3) oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "1303#(and (<= (+ main_~q~2 3) oldRank0) (distinct main_~p~2 main_~q~2) (<= 1 main_~q~2))")
		 ("1278#(<= (+ main_~q~2 3) oldRank0)" "assume true;" "1278#(<= (+ main_~q~2 3) oldRank0)")
	},
	returnTransitions = {
		 ("1239#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1236#unseeded" "return;" "1236#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration7 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" },
	returnAlphabet = {"return;" "return;" },
	states = {"1840#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "1819#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "1804#unseeded" "1820#(<= main_~q~2 oldRank0)" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"1804#unseeded" },
	finalStates = {"1819#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" },
	callTransitions = {
		 ("1804#unseeded" "call #t~ret4 := main();" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1804#unseeded" "call ULTIMATE.init();" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1840#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "1840#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("1840#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1819#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("1819#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "1820#(<= main_~q~2 oldRank0)")
		 ("1820#(<= main_~q~2 oldRank0)" "assume true;" "1820#(<= main_~q~2 oldRank0)")
		 ("1820#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "1840#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~q~2 < ~p~2);" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;~q~2 := #t~nondet3;havoc #t~nondet3;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1819#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))")
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;~p~2 := #t~nondet2;havoc #t~nondet2;" "1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("1807#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1804#unseeded" "return;" "1804#unseeded")
	}
);


2019-05-11 07:10:28,630 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Timing statistics
2019-05-11 07:10:28,631 INFO  [BasicToolchainJob.java:95]:     BüchiAutomizer plugin needed 2.7s and 8 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization removed 36 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 6.	Nontrivial modules had stage [3, 1, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/4	EdgeCheckerBenchmarkData: HoareTripleChecks: 7 SDtfs, 1 SDslu, 10 SDs, 0 lazy, 361 Sat,322 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.3s	LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks:   Termination: inital20 mio100 ax100 hnf106 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf98 smp89 dnf100 smp100 tf106 neg100 sie100    Nontermination: inital20 mio100 ax100 hnf106 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf98 smp89 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 
2019-05-11 07:10:28,631 INFO  [BasicToolchainJob.java:89]:   - TerminationAnalysisResult: Termination proven
2019-05-11 07:10:28,631 INFO  [BasicToolchainJob.java:95]:     Buchi Automizer proved that your program is terminating
2019-05-11 07:10:28,631 INFO  [BasicToolchainJob.java:75]:  * Results from UltimateCore:
2019-05-11 07:10:28,632 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Toolchain Benchmarks
2019-05-11 07:10:28,638 INFO  [BasicToolchainJob.java:95]:     Benchmark results are:
 * CDTParser took 109.78 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * CACSL2BoogieTranslator took 111.26 ms. Allocated memory is still 643.3 MB. Free memory was 604.2 MB in the beginning and 600.2 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.41 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
 * RCFGBuilder took 208.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 582.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB
 * BlockEncoding took 61.29 ms. Allocated memory is still 643.3 MB. Free memory was 582.6 MB in the beginning and 578.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB
 * TraceAbstraction took 98.37 ms. Allocated memory is still 643.3 MB. Free memory was 578.6 MB in the beginning and 571.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * BuchiAutomizer took 2800.31 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 571.9 MB in the beginning and 370.8 MB in the end (delta: 201.1 MB). Peak memory consumption was 204.3 MB. Max. memory is 53.1 GB
2019-05-11 07:10:28,665 INFO  [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0
Closed successfully