YES 2019-05-11 07:09:42,304 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:42,307 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,310 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,310 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:42,311 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:42,312 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:42,312 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:42,312 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:42,313 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:42,315 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:42,316 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:42,316 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:42,316 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:42,316 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:42,317 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,318 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:44,651 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:44,651 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:44,652 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:44,652 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:45,005 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:45,005 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:45,005 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:45,006 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:45,006 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:45,006 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:45,006 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:45,006 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:45,007 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:45,007 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:45,007 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:45,007 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:45,007 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:45,008 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:45,008 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:45,008 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:45,008 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:45,008 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:45,009 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:45,009 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:45,009 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:45,009 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:45,009 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:45,010 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:45,010 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:45,010 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:45,010 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:45,010 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:45,011 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:45,011 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:45,011 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:45,011 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:45,011 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:45,012 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:45,012 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:45,225 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:45,232 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:45,233 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:45,236 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:45,237 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:45,237 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:45,238 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:45,360 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:45,361 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:45,362 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:45,362 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:45,365 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:45,366 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,471 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:45,471 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:45,471 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:45,472 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:45,487 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,492 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,492 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,493 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,495 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,495 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,496 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:45,497 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:45,497 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:45,497 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:45,498 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,595 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:09:45,597 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:45,700 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:45,700 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:45,700 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:45,702 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:45,702 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,715 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,730 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:45,731 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:45,753 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:45,753 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:45,753 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:45,754 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:45,755 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:45" (1/5) ... 2019-05-11 07:09:45,760 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:45" (2/5) ... 2019-05-11 07:09:45,760 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:45" (3/5) ... 2019-05-11 07:09:45,760 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:45" (4/5) ... 2019-05-11 07:09:45,761 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:45" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:45,856 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:45,856 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:45,856 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:45,857 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:45,859 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:47,562 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:47,563 INFO [Benchmark.java:150]: Toolchain (without parser) took 2203.15 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.1 MB in the beginning and 599.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 7.9 MB. Max. memory is 53.1 GB 2019-05-11 07:09:47,566 INFO [Benchmark.java:150]: CDTParser took 111.11 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:09:47,567 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 109.46 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:47,568 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.09 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:47,568 INFO [Benchmark.java:150]: RCFGBuilder took 203.57 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 584.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 53.1 GB 2019-05-11 07:09:47,569 INFO [Benchmark.java:150]: BlockEncoding took 52.43 ms. Allocated memory is still 643.3 MB. Free memory was 584.6 MB in the beginning and 580.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:09:47,570 INFO [Benchmark.java:150]: TraceAbstraction took 103.12 ms. Allocated memory is still 643.3 MB. Free memory was 580.6 MB in the beginning and 573.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:09:47,571 INFO [Benchmark.java:150]: BuchiAutomizer took 1706.19 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 573.9 MB in the beginning and 599.4 MB in the end (delta: -25.5 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:47,578 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:09:47,578 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:47,578 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:47,578 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:47,578 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 14]: Procedure Contract for main 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:47,579 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:47,580 INFO [BasicToolchainJob.java:95]: CFG has 13 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 13 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:09:47,580 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:47,580 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:47,580 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 6 locations. One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * x + 101 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:09:47,580 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:47,581 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration1 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "50#false" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "76#unseeded" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"76#unseeded" }, finalStates = {"50#false" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("76#unseeded" "call #t~ret0 := main();" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("76#unseeded" "call ULTIMATE.init();" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("50#false" "assume true;" "50#false") ("50#false" "#res := 0;assume true;" "50#false") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "assume !true;" "50#false") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !(~y~1 >= 0);" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !true;" "50#false") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "#res := 0;assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("50#false" "76#unseeded" "return;" "50#false") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "76#unseeded" "return;" "76#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "251#unseeded" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"251#unseeded" }, finalStates = {"263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("251#unseeded" "call #t~ret0 := main();" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("251#unseeded" "call ULTIMATE.init();" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~1 >= 0);" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "251#unseeded" "return;" "251#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration3 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "623#unseeded" }, initialStates = {"623#unseeded" }, finalStates = {"635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("623#unseeded" "call #t~ret0 := main();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("623#unseeded" "call ULTIMATE.init();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~1 := ~x~1 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~1 >= 0);" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") }, returnTransitions = { ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "623#unseeded" "return;" "623#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "50#false" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "76#unseeded" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"76#unseeded" }, finalStates = {"50#false" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("76#unseeded" "call #t~ret0 := main();" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("76#unseeded" "call ULTIMATE.init();" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("50#false" "assume true;" "50#false") ("50#false" "#res := 0;assume true;" "50#false") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "assume !true;" "50#false") ("85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !(~y~1 >= 0);" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !true;" "50#false") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "#res := 0;assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "86#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("86#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "97#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "85#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("50#false" "76#unseeded" "return;" "50#false") ("79#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "76#unseeded" "return;" "76#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "251#unseeded" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"251#unseeded" }, finalStates = {"263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("251#unseeded" "call #t~ret0 := main();" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("251#unseeded" "call ULTIMATE.init();" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "264#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("264#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "273#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "263#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~1 >= 0);" "254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("254#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "251#unseeded" "return;" "251#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "623#unseeded" }, initialStates = {"623#unseeded" }, finalStates = {"635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" }, callTransitions = { ("623#unseeded" "call #t~ret0 := main();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("623#unseeded" "call ULTIMATE.init();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~1 := ~x~1 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~1 >= 0);" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))") ("635#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~1) 2) oldRank0))" "~x~1 := ~x~1 + 1;" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume true;" "636#(<= (+ (* 2 main_~y~1) 1) oldRank0)") ("636#(<= (+ (* 2 main_~y~1) 1) oldRank0)" "assume !!(~y~1 >= 0);" "645#(and (<= 0 main_~y~1) (<= (+ (* 2 main_~y~1) 1) oldRank0))") }, returnTransitions = { ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "623#unseeded" "return;" "623#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret0 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "~x~1 := ~x~1 + 1;" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "assume !true;" "assume !(~y~1 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~y~1 >= 0);" }, returnAlphabet = {"return;" "return;" }, states = {"835#(and (<= 101 (+ (* 2 main_~x~1) oldRank0)) (<= main_~x~1 50))" "825#(and (<= 0 oldRank0) (<= 102 (+ (* 2 main_~x~1) oldRank0)))" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "812#unseeded" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"812#unseeded" }, finalStates = {"825#(and (<= 0 oldRank0) (<= 102 (+ (* 2 main_~x~1) oldRank0)))" }, callTransitions = { ("812#unseeded" "call #t~ret0 := main();" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("812#unseeded" "call ULTIMATE.init();" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("835#(and (<= 101 (+ (* 2 main_~x~1) oldRank0)) (<= main_~x~1 50))" "~x~1 := ~x~1 + 1;" "825#(and (<= 0 oldRank0) (<= 102 (+ (* 2 main_~x~1) oldRank0)))") ("825#(and (<= 0 oldRank0) (<= 102 (+ (* 2 main_~x~1) oldRank0)))" "assume true;" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))") ("826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "assume !(~x~1 <= 50);~y~1 := ~y~1 - 1;" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))") ("826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "~x~1 := ~x~1 + 1;" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))") ("826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "835#(and (<= 101 (+ (* 2 main_~x~1) oldRank0)) (<= main_~x~1 50))") ("826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "assume true;" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))") ("826#(<= 101 (+ (* 2 main_~x~1) oldRank0))" "assume !!(~y~1 >= 0);" "826#(<= 101 (+ (* 2 main_~x~1) oldRank0))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~1 := ~x~1 + 1;" "825#(and (<= 0 oldRank0) (<= 102 (+ (* 2 main_~x~1) oldRank0)))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~1;havoc ~y~1;~x~1 := 0;~y~1 := 0;" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~1 <= 50;~y~1 := ~y~1 + 1;" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~1 >= 0);" "815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("815#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "812#unseeded" "return;" "812#unseeded") } ); 2019-05-11 07:09:47,582 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:47,582 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.6s and 5 iterations. Analysis of lassos took 0.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization removed 24 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/13 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 39 SDtfs, 6 SDslu, 38 SDs, 0 lazy, 181 Sat,122 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf96 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf96 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:09:47,582 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:47,582 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:47,583 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:47,583 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:47,589 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.11 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 109.46 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.09 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 203.57 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 584.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 53.1 GB * BlockEncoding took 52.43 ms. Allocated memory is still 643.3 MB. Free memory was 584.6 MB in the beginning and 580.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 103.12 ms. Allocated memory is still 643.3 MB. Free memory was 580.6 MB in the beginning and 573.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1706.19 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 573.9 MB in the beginning and 599.4 MB in the end (delta: -25.5 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:47,615 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully