YES 2019-05-11 07:10:08,534 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:08,537 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,540 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,541 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:08,542 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:08,542 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:08,542 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:08,543 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:08,543 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:08,545 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:08,546 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:08,546 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:08,546 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:08,547 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:08,547 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,548 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:10,136 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:10,136 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:10,136 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:10,136 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:10,569 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:10,569 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:10,570 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:10,570 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:10,570 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:10,570 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:10,570 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:10,571 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:10,571 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:10,571 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:10,571 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:10,571 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:10,572 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:10,572 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:10,572 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:10,572 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:10,572 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:10,572 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:10,573 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:10,573 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:10,573 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:10,573 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:10,573 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:10,574 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:10,574 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:10,574 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:10,574 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:10,574 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:10,574 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:10,575 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:10,575 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:10,575 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:10,575 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:10,575 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:10,576 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:10,792 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:10,799 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:10,799 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:10,801 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:10,803 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:10,803 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:10,803 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:10,925 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:10,927 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:10,927 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:10,927 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:10,931 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:10,931 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:10" (1/1) ... 2019-05-11 07:10:11,039 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:11,040 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:11,040 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:11,040 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:11,056 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,061 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,061 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,063 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,064 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,065 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,066 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:11,066 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:11,066 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:11,066 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:11,068 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,167 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:10:11,169 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:11,285 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:11,286 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:11,286 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:11,287 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:11,288 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,302 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,342 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,343 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,344 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,345 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,346 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:11,346 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:11,346 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:11,348 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:11,348 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:10:11" (1/5) ... 2019-05-11 07:10:11,349 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:11" (2/5) ... 2019-05-11 07:10:11,349 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (3/5) ... 2019-05-11 07:10:11,350 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:10" (4/5) ... 2019-05-11 07:10:11,350 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:11,445 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:11,445 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:11,445 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:11,446 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:11,448 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:13,603 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:13,603 INFO [Benchmark.java:150]: Toolchain (without parser) took 2677.85 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 516.4 MB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,606 INFO [Benchmark.java:150]: CDTParser took 110.92 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,607 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.69 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,608 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.70 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,608 INFO [Benchmark.java:150]: RCFGBuilder took 219.60 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,609 INFO [Benchmark.java:150]: BlockEncoding took 60.29 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,610 INFO [Benchmark.java:150]: TraceAbstraction took 98.67 ms. Allocated memory is still 649.6 MB. Free memory was 585.1 MB in the beginning and 578.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,611 INFO [Benchmark.java:150]: BuchiAutomizer took 2157.62 ms. Allocated memory is still 649.6 MB. Free memory was 578.3 MB in the beginning and 516.4 MB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,617 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:10:13,617 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:13,617 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:13,618 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:13,618 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:13,618 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:10:13,618 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:10:13,618 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 13]: Loop Invariant 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:13,619 INFO [BasicToolchainJob.java:95]: CFG has 12 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 12 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:10:13,620 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:13,620 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:13,620 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + 0 and consists of 6 locations. One deterministic module has affine ranking function xtmp + 0 and consists of 4 locations. One deterministic module has affine ranking function xtmp + 0 and consists of 6 locations. One deterministic module has affine ranking function y + 0 and consists of 5 locations. One nondeterministic module has affine ranking function xtmp + 0 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. 2019-05-11 07:10:13,620 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:13,620 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "313#unseeded" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "348#(<= main_~y~2 oldRank0)" }, initialStates = {"313#unseeded" }, finalStates = {"326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("313#unseeded" "call #t~ret2 := main();" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("313#unseeded" "call ULTIMATE.init();" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "348#(<= main_~y~2 oldRank0)") ("339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))") ("348#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "348#(<= main_~y~2 oldRank0)") ("348#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "348#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "313#unseeded" "return;" "313#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"81#unseeded" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "101#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2) (<= 1 oldRank0))" "90#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "91#(<= main_~y~2 oldRank0)" "94#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" }, initialStates = {"81#unseeded" }, finalStates = {"90#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("81#unseeded" "call #t~ret2 := main();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("81#unseeded" "call ULTIMATE.init();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "90#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("101#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2) (<= 1 oldRank0))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "90#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("90#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "94#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))") ("91#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "91#(<= main_~y~2 oldRank0)") ("91#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "91#(<= main_~y~2 oldRank0)") ("94#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "91#(<= main_~y~2 oldRank0)") ("94#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "101#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2) (<= 1 oldRank0))") }, returnTransitions = { ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "81#unseeded" "return;" "81#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "183#(<= main_~xtmp~2 oldRank0)" "170#unseeded" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"170#unseeded" }, finalStates = {"182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("170#unseeded" "call #t~ret2 := main();" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#unseeded" "call ULTIMATE.init();" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "183#(<= main_~xtmp~2 oldRank0)") ("183#(<= main_~xtmp~2 oldRank0)" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "183#(<= main_~xtmp~2 oldRank0)") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "182#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("173#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "170#unseeded" "return;" "170#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "313#unseeded" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "348#(<= main_~y~2 oldRank0)" }, initialStates = {"313#unseeded" }, finalStates = {"326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("313#unseeded" "call #t~ret2 := main();" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("313#unseeded" "call ULTIMATE.init();" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "348#(<= main_~y~2 oldRank0)") ("339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "326#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("332#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "339#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 main_~xtmp~2))") ("348#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "348#(<= main_~y~2 oldRank0)") ("348#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "348#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("316#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "313#unseeded" "return;" "313#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"513#unseeded" "529#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "536#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "554#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" }, initialStates = {"513#unseeded" }, finalStates = {"529#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("513#unseeded" "call #t~ret2 := main();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("513#unseeded" "call ULTIMATE.init();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("529#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "536#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "529#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("536#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "536#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("536#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "554#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))") ("554#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "529#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") }, returnTransitions = { ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "513#unseeded" "return;" "513#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "assume true;" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "assume true;" "assume true;assume !(~y~2 > 0 && ~x~2 > 0);" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "822#(<= main_~xtmp~2 oldRank0)" "811#unseeded" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"811#unseeded" }, finalStates = {"821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("811#unseeded" "call #t~ret2 := main();" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("811#unseeded" "call ULTIMATE.init();" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "822#(<= main_~xtmp~2 oldRank0)") ("822#(<= main_~xtmp~2 oldRank0)" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "822#(<= main_~xtmp~2 oldRank0)") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2 && ~y~2 > 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2 && ~y~2 > 0);" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~xtmp~2;~x~2 := ~tmp~2;" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "821#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("814#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "811#unseeded" "return;" "811#unseeded") } ); 2019-05-11 07:10:13,621 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:13,622 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.1s and 7 iterations. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization removed 30 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 2/4 InterpolantCoveringCapabilityBuchi: 1/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 16 SDtfs, 4 SDslu, 12 SDs, 0 lazy, 162 Sat,134 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf91 smp100 dnf100 smp100 tf107 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf91 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:10:13,622 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:13,623 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:13,623 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:13,623 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:13,629 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.92 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.69 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.70 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 219.60 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB * BlockEncoding took 60.29 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.67 ms. Allocated memory is still 649.6 MB. Free memory was 585.1 MB in the beginning and 578.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2157.62 ms. Allocated memory is still 649.6 MB. Free memory was 578.3 MB in the beginning and 516.4 MB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:13,654 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully