YES 2019-05-11 07:10:39,719 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:39,723 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,726 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,727 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:39,728 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:39,728 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:39,728 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:39,729 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:39,729 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:39,731 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:39,732 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:39,732 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:39,732 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:39,733 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:39,733 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,734 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:42,227 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:42,228 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:42,228 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:42,228 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:42,573 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:42,574 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:42,592 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:42,593 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:42,593 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,593 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:42,593 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,593 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:42,594 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:42,594 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:42,594 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:42,594 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:42,594 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:42,595 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:42,595 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:42,595 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:42,595 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:42,595 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:42,596 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:42,596 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:42,596 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:42,596 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:42,597 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:42,597 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:42,597 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:42,597 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:42,597 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:42,598 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:42,598 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:42,598 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:42,598 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,598 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,599 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,599 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,599 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:42,814 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:42,821 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:42,822 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:42,824 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:42,825 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:42,826 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:42,826 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:42,950 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:42,952 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:42,952 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:42,953 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:42,956 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:42,957 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:42" (1/1) ... 2019-05-11 07:10:43,063 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:43,064 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:43,064 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:43,064 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:43,080 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:43" (1/1) ... 2019-05-11 07:10:43,084 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:43" (1/1) ... 2019-05-11 07:10:43,085 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:43" (1/1) ... 2019-05-11 07:10:43,086 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:43" (1/1) ... 2019-05-11 07:10:43,087 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:43" (1/1) ... 2019-05-11 07:10:43,088 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:43" (1/1) ... 2019-05-11 07:10:43,089 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:43,089 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:43,090 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:43,090 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:43,091 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:43" (1/1) ... 2019-05-11 07:10:43,185 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:43,187 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:43,300 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:43,301 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:43,301 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:43,302 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:43,302 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:43" (1/1) ... 2019-05-11 07:10:43,316 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:43" (1/1) ... 2019-05-11 07:10:43,343 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,344 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,364 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:43,364 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:43,364 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:43,365 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:43,366 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:43" (1/5) ... 2019-05-11 07:10:43,367 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:43" (2/5) ... 2019-05-11 07:10:43,367 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:43" (3/5) ... 2019-05-11 07:10:43,367 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:43" (4/5) ... 2019-05-11 07:10:43,368 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:43,465 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:43,466 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:43,466 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:43,466 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:43,469 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:43" (1/1) ... 2019-05-11 07:10:45,594 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:45,595 INFO [Benchmark.java:150]: Toolchain (without parser) took 2645.03 ms. Allocated memory is still 649.6 MB. Free memory was 613.0 MB in the beginning and 537.4 MB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:45,598 INFO [Benchmark.java:150]: CDTParser took 113.05 ms. Allocated memory is still 649.6 MB. Free memory was 621.1 MB in the beginning and 614.3 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:45,599 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.08 ms. Allocated memory is still 649.6 MB. Free memory was 613.0 MB in the beginning and 606.3 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:45,600 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.43 ms. Allocated memory is still 649.6 MB. Free memory was 606.3 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:45,601 INFO [Benchmark.java:150]: RCFGBuilder took 211.06 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB 2019-05-11 07:10:45,601 INFO [Benchmark.java:150]: BlockEncoding took 63.21 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.4 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:45,602 INFO [Benchmark.java:150]: TraceAbstraction took 101.35 ms. Allocated memory is still 649.6 MB. Free memory was 584.4 MB in the beginning and 577.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:45,603 INFO [Benchmark.java:150]: BuchiAutomizer took 2129.14 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 537.4 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 53.1 GB 2019-05-11 07:10:45,609 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:45,610 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:45,610 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:45,610 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:45,610 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:45,610 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:45,611 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:10:45,611 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:45,611 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 12]: Loop Invariant 2019-05-11 07:10:45,611 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:45,611 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:45,611 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:10:45,612 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:45,612 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:45,612 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * y + x + 0 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 7 locations. One deterministic module has affine ranking function x + 0 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 2019-05-11 07:10:45,612 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:45,612 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~x~2 > ~y~2;~x~2 := ~y~2;" "assume !!(~x~2 == 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "#res := 0;assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!!(~x~2 == 0);" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "~c~2 := ~c~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "299#unseeded" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" }, initialStates = {"299#unseeded" }, finalStates = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("299#unseeded" "call #t~ret2 := main();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("299#unseeded" "call ULTIMATE.init();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !!!(~x~2 == 0);" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!!(~x~2 == 0);" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "299#unseeded" "return;" "299#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~x~2 > ~y~2;~x~2 := ~y~2;" "assume !!(~x~2 == 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "#res := 0;assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!!(~x~2 == 0);" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "~c~2 := ~c~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "299#unseeded" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" }, initialStates = {"299#unseeded" }, finalStates = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("299#unseeded" "call #t~ret2 := main();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("299#unseeded" "call ULTIMATE.init();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !!!(~x~2 == 0);" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!!(~x~2 == 0);" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "299#unseeded" "return;" "299#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~x~2 > ~y~2;~x~2 := ~y~2;" "assume !!(~x~2 == 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "#res := 0;assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!!(~x~2 == 0);" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "~c~2 := ~c~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))" }, initialStates = {"52#unseeded" }, finalStates = {"27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("52#unseeded" "call #t~ret2 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("52#unseeded" "assume true;" "52#unseeded") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("27#false" "assume true;" "27#false") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume !true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !!(~x~2 == 0);" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !true;" "27#false") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !!!(~x~2 == 0);" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "#res := 0;assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("27#false" "52#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~x~2 > ~y~2;~x~2 := ~y~2;" "assume !!(~x~2 == 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "#res := 0;assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!!(~x~2 == 0);" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "~c~2 := ~c~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"177#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "194#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "182#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "168#unseeded" "186#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"168#unseeded" }, finalStates = {"194#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("168#unseeded" "call #t~ret2 := main();" "171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#unseeded" "call ULTIMATE.init();" "171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("177#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !!!(~x~2 == 0);" "186#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))") ("181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "182#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("182#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "182#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("182#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!!(~x~2 == 0);" "186#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))") ("186#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "194#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("186#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "181#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "177#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("171#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "168#unseeded" "return;" "168#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~x~2 > ~y~2;~x~2 := ~y~2;" "assume !!(~x~2 == 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume !(~x~2 > 0 && ~y~2 > 0);" "#res := 0;assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!!(~x~2 == 0);" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "~c~2 := ~c~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "299#unseeded" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" }, initialStates = {"299#unseeded" }, finalStates = {"323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("299#unseeded" "call #t~ret2 := main();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("299#unseeded" "call ULTIMATE.init();" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !!!(~x~2 == 0);" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("314#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~c~2 := ~c~2 + 1;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;assume ~x~2 > 0 && ~y~2 > 0;" "308#(and unseeded (<= 1 main_~x~2) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;" "319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))") ("319#(and (<= 0 main_~x~2) (<= main_~x~2 oldRank0))" "assume !!!(~x~2 == 0);" "335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume ~x~2 > ~y~2;~x~2 := ~y~2;" "323#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("335#(and (<= 0 main_~x~2) (distinct main_~x~2 0) (<= main_~x~2 oldRank0))" "assume !(~x~2 > ~y~2);~x~2 := ~x~2 - 1;" "318#(and (<= 0 main_~x~2) (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("302#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "299#unseeded" "return;" "299#unseeded") } ); 2019-05-11 07:10:45,613 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:45,614 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.1s and 6 iterations. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization removed 20 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 8/8 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 20 SDtfs, 0 SDslu, 11 SDs, 0 lazy, 120 Sat,76 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital22 mio100 ax100 hnf93 lsp71 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf103 smp100 dnf153 smp100 tf103 neg100 sie100 Nontermination: inital22 mio100 ax100 hnf93 lsp71 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf103 smp100 dnf153 smp100 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 147ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 2019-05-11 07:10:45,615 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:45,615 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:45,615 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:45,615 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:45,622 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 113.05 ms. Allocated memory is still 649.6 MB. Free memory was 621.1 MB in the beginning and 614.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.08 ms. Allocated memory is still 649.6 MB. Free memory was 613.0 MB in the beginning and 606.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.43 ms. Allocated memory is still 649.6 MB. Free memory was 606.3 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 211.06 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB * BlockEncoding took 63.21 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 101.35 ms. Allocated memory is still 649.6 MB. Free memory was 584.4 MB in the beginning and 577.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2129.14 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 537.4 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 53.1 GB 2019-05-11 07:10:45,648 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully