YES 2019-05-11 07:12:39,912 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:12:39,915 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:12:39,919 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:12:39,919 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:12:39,920 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:12:39,920 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:12:39,921 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:12:39,921 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:12:39,921 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:12:39,924 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:12:39,924 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:12:39,924 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:12:39,925 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:12:39,925 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:12:39,925 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:12:39,926 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:12:42,063 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:12:42,064 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:12:42,064 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:12:42,064 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:12:42,416 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:12:42,416 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:12:42,416 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:12:42,417 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:12:42,417 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:42,417 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:12:42,417 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:42,417 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:12:42,418 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:12:42,418 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:12:42,418 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:12:42,418 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:12:42,418 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:12:42,418 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:12:42,419 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:12:42,419 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:12:42,419 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:12:42,419 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:12:42,419 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:12:42,419 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:12:42,420 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:12:42,420 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:12:42,420 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:12:42,420 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:12:42,420 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:12:42,421 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:12:42,421 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:12:42,421 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:12:42,421 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:12:42,421 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:12:42,421 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:42,422 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:42,422 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:42,422 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:42,422 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:12:42,641 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:12:42,648 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:42,648 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:12:42,650 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:12:42,652 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:12:42,652 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:12:42,652 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:42,775 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:12:42,777 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:12:42,777 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:42,777 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:12:42,780 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:12:42,781 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:12:42" (1/1) ... 2019-05-11 07:12:42,891 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:42,892 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:12:42,892 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:12:42,892 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:12:42,908 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:12:42" (1/1) ... 2019-05-11 07:12:42,913 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:12:42" (1/1) ... 2019-05-11 07:12:42,913 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:12:42" (1/1) ... 2019-05-11 07:12:42,915 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:12:42" (1/1) ... 2019-05-11 07:12:42,917 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:12:42" (1/1) ... 2019-05-11 07:12:42,917 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:12:42" (1/1) ... 2019-05-11 07:12:42,919 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:12:42,919 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:12:42,919 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:12:42,919 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:12:42,921 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:42" (1/1) ... 2019-05-11 07:12:43,018 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:12:43,021 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:12:43,142 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:12:43,142 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:12:43,142 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:12:43,143 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:12:43,144 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:43" (1/1) ... 2019-05-11 07:12:43,157 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:43" (1/1) ... 2019-05-11 07:12:43,174 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:43,175 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:43,204 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:12:43,205 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:12:43,205 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:12:43,206 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:12:43,207 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:12:43" (1/5) ... 2019-05-11 07:12:43,208 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:12:43" (2/5) ... 2019-05-11 07:12:43,208 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:43" (3/5) ... 2019-05-11 07:12:43,209 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:42" (4/5) ... 2019-05-11 07:12:43,209 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:12:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:12:43,303 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:12:43,303 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:12:43,303 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:12:43,303 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:12:43,305 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:12:43" (1/1) ... 2019-05-11 07:12:46,400 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:12:46,401 INFO [Benchmark.java:150]: Toolchain (without parser) took 3625.78 ms. Allocated memory was 514.9 MB in the beginning and 569.4 MB in the end (delta: 54.5 MB). Free memory was 483.4 MB in the beginning and 480.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 57.8 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,404 INFO [Benchmark.java:150]: CDTParser took 111.88 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,405 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 114.62 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,406 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.80 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,406 INFO [Benchmark.java:150]: RCFGBuilder took 222.95 ms. Allocated memory is still 514.9 MB. Free memory was 477.2 MB in the beginning and 464.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,407 INFO [Benchmark.java:150]: BlockEncoding took 62.36 ms. Allocated memory is still 514.9 MB. Free memory was 464.5 MB in the beginning and 459.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,408 INFO [Benchmark.java:150]: TraceAbstraction took 98.15 ms. Allocated memory is still 514.9 MB. Free memory was 459.8 MB in the beginning and 452.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,409 INFO [Benchmark.java:150]: BuchiAutomizer took 3097.68 ms. Allocated memory was 514.9 MB in the beginning and 569.4 MB in the end (delta: 54.5 MB). Free memory was 452.3 MB in the beginning and 480.1 MB in the end (delta: -27.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,415 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:12:46,415 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:12:46,415 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:12:46,416 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:95]: CFG has 17 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 17 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 6 locations. One deterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 5 locations. One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * y + 2 * n + 1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 2019-05-11 07:12:46,417 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:12:46,418 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "30#false" "63#unseeded" }, initialStates = {"63#unseeded" }, finalStates = {"72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "30#false" }, callTransitions = { ("63#unseeded" "call #t~ret6 := main();" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("63#unseeded" "call ULTIMATE.init();" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !true;" "30#false") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !true;" "30#false") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "#res := 0;assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("30#false" "#res := 0;assume true;" "30#false") ("30#false" "assume true;" "30#false") }, returnTransitions = { ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "63#unseeded" "return;" "63#unseeded") ("30#false" "63#unseeded" "return;" "30#false") } ); NestedWordAutomaton finiteAutomatonIteration7 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "1836#unseeded" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"1836#unseeded" }, finalStates = {"1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("1836#unseeded" "call #t~ret6 := main();" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1836#unseeded" "call ULTIMATE.init();" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1836#unseeded" "return;" "1836#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "30#false" "63#unseeded" }, initialStates = {"63#unseeded" }, finalStates = {"72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "30#false" }, callTransitions = { ("63#unseeded" "call #t~ret6 := main();" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("63#unseeded" "call ULTIMATE.init();" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !true;" "30#false") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("72#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !true;" "30#false") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "#res := 0;assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "83#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("73#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "73#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("30#false" "#res := 0;assume true;" "30#false") ("30#false" "assume true;" "30#false") }, returnTransitions = { ("66#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "63#unseeded" "return;" "63#unseeded") ("30#false" "63#unseeded" "return;" "30#false") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "327#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "285#unseeded" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" }, initialStates = {"285#unseeded" }, finalStates = {"300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("285#unseeded" "call #t~ret6 := main();" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("285#unseeded" "call ULTIMATE.init();" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("327#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "327#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))") ("327#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("300#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "327#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))") ("301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "301#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") }, returnTransitions = { ("288#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "285#unseeded" "return;" "285#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"484#unseeded" "500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "501#(<= main_~x~2 oldRank0)" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" }, initialStates = {"484#unseeded" }, finalStates = {"500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("484#unseeded" "call #t~ret6 := main();" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("484#unseeded" "call ULTIMATE.init();" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "501#(<= main_~x~2 oldRank0)") ("500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "501#(<= main_~x~2 oldRank0)") ("500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume true;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume true;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") ("501#(<= main_~x~2 oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume true;" "501#(<= main_~x~2 oldRank0)") ("501#(<= main_~x~2 oldRank0)" "assume true;" "501#(<= main_~x~2 oldRank0)") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;" "536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") ("536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "500#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;" "536#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") }, returnTransitions = { ("487#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "484#unseeded" "return;" "484#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"713#unseeded" "762#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)" }, initialStates = {"713#unseeded" }, finalStates = {"733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("713#unseeded" "call #t~ret6 := main();" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("713#unseeded" "call ULTIMATE.init();" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("762#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;" "762#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("762#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("733#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("734#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("734#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "762#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("734#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "734#(<= (+ (* 2 main_~y~2) 1) oldRank0)") }, returnTransitions = { ("716#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "713#unseeded" "return;" "713#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "1836#unseeded" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"1836#unseeded" }, finalStates = {"1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("1836#unseeded" "call #t~ret6 := main();" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1836#unseeded" "call ULTIMATE.init();" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "1857#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;" "1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1884#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1856#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("1839#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1836#unseeded" "return;" "1836#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration8 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "assume true;" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "assume true;" "assume !((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"2866#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "2824#unseeded" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"2824#unseeded" }, finalStates = {"2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("2824#unseeded" "call #t~ret6 := main();" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2824#unseeded" "call ULTIMATE.init();" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("2866#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "2866#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))") ("2866#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "2866#(and (<= main_~y~2 main_~n~2) (<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0)))") ("2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "2840#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~b~2 := 1;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~b~2 == 0);~y~2 := ~y~2 - 1;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet5 != 0);havoc #t~nondet5;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet5 != 0;havoc #t~nondet5;~x~2 := ~x~2 - 1;~b~2 := 0;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;havoc ~b~2;~n~2 := #t~nondet0;havoc #t~nondet0;~b~2 := #t~nondet1;havoc #t~nondet1;~x~2 := #t~nondet2;havoc #t~nondet2;~y~2 := #t~nondet3;havoc #t~nondet3;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((~x~2 >= 0 && 0 <= ~y~2) && ~y~2 <= ~n~2);" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "2839#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~b~2 == 0;~y~2 := ~y~2 + 1;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("2827#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2824#unseeded" "return;" "2824#unseeded") } ); 2019-05-11 07:12:46,420 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:12:46,421 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 3.0s and 9 iterations. Analysis of lassos took 1.0s. Construction of modules took 0.5s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization removed 149 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 4/4 InterpolantCoveringCapabilityBuchi: 4/4 EdgeCheckerBenchmarkData: HoareTripleChecks: 42 SDtfs, 3 SDslu, 19 SDs, 0 lazy, 469 Sat,405 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.5s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital24 mio100 ax100 hnf96 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf96 smp100 dnf106 smp100 tf110 neg100 sie100 Nontermination: inital24 mio100 ax100 hnf96 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf96 smp100 dnf106 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:12:46,421 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:12:46,421 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:12:46,422 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:12:46,422 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:12:46,428 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.88 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 114.62 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 26.80 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 53.1 GB * RCFGBuilder took 222.95 ms. Allocated memory is still 514.9 MB. Free memory was 477.2 MB in the beginning and 464.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 53.1 GB * BlockEncoding took 62.36 ms. Allocated memory is still 514.9 MB. Free memory was 464.5 MB in the beginning and 459.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.15 ms. Allocated memory is still 514.9 MB. Free memory was 459.8 MB in the beginning and 452.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 53.1 GB * BuchiAutomizer took 3097.68 ms. Allocated memory was 514.9 MB in the beginning and 569.4 MB in the end (delta: 54.5 MB). Free memory was 452.3 MB in the beginning and 480.1 MB in the end (delta: -27.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 53.1 GB 2019-05-11 07:12:46,454 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully