YES 2019-05-11 07:11:39,319 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:39,322 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,326 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,326 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:39,327 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:39,327 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:39,327 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:39,328 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:39,328 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:39,330 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:39,331 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:39,331 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:39,331 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:39,332 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:39,332 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,333 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:41,137 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:41,137 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:41,138 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,138 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:41,494 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:41,494 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,495 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:41,495 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:41,495 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,495 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:41,495 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,496 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:41,496 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:41,496 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:41,496 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:41,496 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:41,497 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:41,497 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:41,497 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:41,497 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:41,497 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:41,497 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:41,498 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:41,498 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:41,498 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:41,498 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:41,498 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:41,499 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:41,499 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:41,499 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:41,499 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:41,499 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:41,499 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:41,500 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:41,500 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,500 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,500 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,500 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,501 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:41,717 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:41,723 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:41,724 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:41,726 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:41,727 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:41,728 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:41,728 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:41,852 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:41,854 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:41,854 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,854 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:41,857 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:41,858 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,969 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,969 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,969 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:41,970 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:41,985 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:11:41" (1/1) ... 2019-05-11 07:11:41,990 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:11:41" (1/1) ... 2019-05-11 07:11:41,990 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:11:41" (1/1) ... 2019-05-11 07:11:41,992 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:11:41" (1/1) ... 2019-05-11 07:11:41,994 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:11:41" (1/1) ... 2019-05-11 07:11:41,994 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:11:41" (1/1) ... 2019-05-11 07:11:41,995 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,996 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:41,996 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:41,996 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:41,997 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:42,097 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:11:42,101 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:11:42,218 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:42,218 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:42,218 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:42,227 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:42,227 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,242 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,262 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,264 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,274 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,275 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,294 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:42,294 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:42,294 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:42,295 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:42,296 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/5) ... 2019-05-11 07:11:42,297 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:41" (2/5) ... 2019-05-11 07:11:42,297 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:42" (3/5) ... 2019-05-11 07:11:42,298 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:42" (4/5) ... 2019-05-11 07:11:42,298 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:42,402 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:42,403 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:42,403 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:42,403 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:42,406 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:44,269 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:44,270 INFO [Benchmark.java:150]: Toolchain (without parser) took 2417.37 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 561.4 MB in the end (delta: 42.8 MB). Peak memory consumption was 45.9 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,272 INFO [Benchmark.java:150]: CDTParser took 113.02 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:11:44,273 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 115.11 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:11:44,274 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.25 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:11:44,275 INFO [Benchmark.java:150]: RCFGBuilder took 222.15 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,276 INFO [Benchmark.java:150]: BlockEncoding took 75.70 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 577.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,277 INFO [Benchmark.java:150]: TraceAbstraction took 108.59 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,277 INFO [Benchmark.java:150]: BuchiAutomizer took 1866.26 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 561.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,284 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:11:44,284 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:11:44,285 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 16]: Loop Invariant 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 14]: Loop Invariant 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:44,286 INFO [BasicToolchainJob.java:95]: CFG has 15 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 15 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:11:44,286 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:44,287 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:44,287 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x + 0 and consists of 5 locations. One deterministic module has affine ranking function ytmp + 0 and consists of 4 locations. One deterministic module has affine ranking function -1 * ytmp + 0 and consists of 4 locations. One nondeterministic module has affine ranking function ytmp + 0 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. 2019-05-11 07:11:44,287 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:44,287 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" "532#(<= 0 (+ main_~ytmp~2 oldRank0))" "507#unseeded" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"507#unseeded" }, finalStates = {"531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("507#unseeded" "call ULTIMATE.init();" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("507#unseeded" "call #t~ret2 := main();" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume true;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !!(~ytmp~2 != 0);" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "~res~2 := ~res~2 + 1;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !(~ytmp~2 != 0);" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~ytmp~2 != 0);" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~res~2 := ~res~2 + 1;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 != 0);" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "507#unseeded" "return;" "507#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration6 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "1140#(<= main_~ytmp~2 oldRank0)" "1125#unseeded" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"1125#unseeded" }, finalStates = {"1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" }, callTransitions = { ("1125#unseeded" "call ULTIMATE.init();" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1125#unseeded" "call #t~ret2 := main();" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume !!(~ytmp~2 != 0);" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "~res~2 := ~res~2 + 1;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("1140#(<= main_~ytmp~2 oldRank0)" "assume !(~ytmp~2 != 0);" "1140#(<= main_~ytmp~2 oldRank0)") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~ytmp~2 != 0);" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~res~2 := ~res~2 + 1;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 != 0);" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1125#unseeded" "return;" "1125#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"145#unseeded" "148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "155#(<= main_~x~2 oldRank0)" "158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" }, initialStates = {"145#unseeded" }, finalStates = {"154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("145#unseeded" "call ULTIMATE.init();" "148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("145#unseeded" "call #t~ret2 := main();" "148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "assume true;" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("155#(<= main_~x~2 oldRank0)" "assume !!(~ytmp~2 != 0);" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "~res~2 := ~res~2 + 1;" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "assume true;" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "155#(<= main_~x~2 oldRank0)") ("155#(<= main_~x~2 oldRank0)" "assume !(~ytmp~2 != 0);" "155#(<= main_~x~2 oldRank0)") ("158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!(~ytmp~2 != 0);" "158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("158#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("148#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "145#unseeded" "return;" "145#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "299#(<= main_~ytmp~2 oldRank0)" "284#unseeded" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"284#unseeded" }, finalStates = {"298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" }, callTransitions = { ("284#unseeded" "call ULTIMATE.init();" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("284#unseeded" "call #t~ret2 := main();" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "299#(<= main_~ytmp~2 oldRank0)") ("298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "299#(<= main_~ytmp~2 oldRank0)") ("299#(<= main_~ytmp~2 oldRank0)" "assume true;" "299#(<= main_~ytmp~2 oldRank0)") ("299#(<= main_~ytmp~2 oldRank0)" "assume !!(~ytmp~2 != 0);" "299#(<= main_~ytmp~2 oldRank0)") ("299#(<= main_~ytmp~2 oldRank0)" "~res~2 := ~res~2 + 1;" "299#(<= main_~ytmp~2 oldRank0)") ("299#(<= main_~ytmp~2 oldRank0)" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("299#(<= main_~ytmp~2 oldRank0)" "assume !(~ytmp~2 != 0);" "299#(<= main_~ytmp~2 oldRank0)") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~ytmp~2 != 0);" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "298#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "284#unseeded" "return;" "284#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" "532#(<= 0 (+ main_~ytmp~2 oldRank0))" "507#unseeded" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"507#unseeded" }, finalStates = {"531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("507#unseeded" "call ULTIMATE.init();" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("507#unseeded" "call #t~ret2 := main();" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume true;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !!(~ytmp~2 != 0);" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "~res~2 := ~res~2 + 1;" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("532#(<= 0 (+ main_~ytmp~2 oldRank0))" "assume !(~ytmp~2 != 0);" "532#(<= 0 (+ main_~ytmp~2 oldRank0))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~ytmp~2 != 0);" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "531#(and (<= 1 (+ main_~ytmp~2 oldRank0)) (<= 0 oldRank0))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~res~2 := ~res~2 + 1;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 != 0);" "510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("510#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "507#unseeded" "return;" "507#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret2 := main();" }, internalAlphabet = {"assume !true;" "assume true;" "assume !!(~ytmp~2 != 0);" "assume !(~ytmp~2 > 0);~ytmp~2 := ~ytmp~2 + 1;~x~2 := ~x~2 + 1;" "assume true;" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "assume true;" "assume !(~ytmp~2 != 0);" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "assume !true;" "~res~2 := ~res~2 + 1;" "assume true;assume !(~x~2 >= ~y~2 && ~y~2 > 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "1140#(<= main_~ytmp~2 oldRank0)" "1125#unseeded" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"1125#unseeded" }, finalStates = {"1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" }, callTransitions = { ("1125#unseeded" "call ULTIMATE.init();" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1125#unseeded" "call #t~ret2 := main();" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume true;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume !!(~ytmp~2 != 0);" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "~res~2 := ~res~2 + 1;" "1140#(<= main_~ytmp~2 oldRank0)") ("1140#(<= main_~ytmp~2 oldRank0)" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("1140#(<= main_~ytmp~2 oldRank0)" "assume !(~ytmp~2 != 0);" "1140#(<= main_~ytmp~2 oldRank0)") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~ytmp~2;havoc ~res~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~res~2 := 0;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= ~y~2 && ~y~2 > 0);~ytmp~2 := ~y~2;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~ytmp~2 != 0);" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1139#(and (<= 0 oldRank0) (<= (+ main_~ytmp~2 1) oldRank0))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~res~2 := ~res~2 + 1;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~ytmp~2 > 0;~ytmp~2 := ~ytmp~2 - 1;~x~2 := ~x~2 - 1;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~ytmp~2 != 0);" "1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("1128#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1125#unseeded" "return;" "1125#unseeded") } ); 2019-05-11 07:11:44,288 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:44,289 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.8s and 7 iterations. Analysis of lassos took 0.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization removed 16 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 9/22 InterpolantCoveringCapabilityBuchi: 0/2 EdgeCheckerBenchmarkData: HoareTripleChecks: 38 SDtfs, 6 SDslu, 15 SDs, 0 lazy, 219 Sat,165 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf97 lsp70 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp92 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf97 lsp70 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp92 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:44,289 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:44,289 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:44,289 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:44,289 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:44,296 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 113.02 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 115.11 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 26.25 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 222.15 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB * BlockEncoding took 75.70 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 577.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * TraceAbstraction took 108.59 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1866.26 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 561.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,322 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully