YES 2019-05-11 07:10:24,047 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:24,050 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:24,054 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:24,054 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:24,055 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:24,055 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:24,056 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:24,056 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:24,056 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:24,059 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:24,059 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:24,060 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:24,060 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:24,060 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:24,061 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:24,062 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:25,623 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:25,623 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:25,623 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:25,623 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:25,973 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:25,974 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:25,974 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:25,974 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:25,974 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:25,975 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:25,975 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:25,975 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:25,975 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:25,975 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:25,976 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:25,976 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:25,976 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:25,976 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:25,976 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:25,976 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:25,977 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:25,977 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:25,977 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:25,977 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:25,977 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:25,978 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:25,978 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:25,978 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:25,978 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:25,978 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:25,978 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:25,979 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:25,979 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:25,979 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:25,979 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:25,979 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:25,980 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:25,980 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:25,980 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:26,196 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:26,202 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:26,203 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:26,205 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:26,207 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:26,207 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:26,207 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:26,331 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:26,332 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:26,333 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:26,333 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:26,336 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:26,337 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:26" (1/1) ... 2019-05-11 07:10:26,448 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:26,448 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:26,448 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:26,448 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:26,464 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:26" (1/1) ... 2019-05-11 07:10:26,469 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:26" (1/1) ... 2019-05-11 07:10:26,469 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:26" (1/1) ... 2019-05-11 07:10:26,471 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:26" (1/1) ... 2019-05-11 07:10:26,472 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:26" (1/1) ... 2019-05-11 07:10:26,473 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:26" (1/1) ... 2019-05-11 07:10:26,474 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:26,475 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:26,475 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:26,475 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:26,476 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:26" (1/1) ... 2019-05-11 07:10:26,575 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:26,577 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:26,695 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:26,695 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:26,695 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:26,697 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:26,697 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:26" (1/1) ... 2019-05-11 07:10:26,711 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:26" (1/1) ... 2019-05-11 07:10:26,743 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:26,744 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:26,772 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:26,772 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:26,772 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:26,773 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:26,774 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:26" (1/5) ... 2019-05-11 07:10:26,775 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:26" (2/5) ... 2019-05-11 07:10:26,775 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:26" (3/5) ... 2019-05-11 07:10:26,775 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:26" (4/5) ... 2019-05-11 07:10:26,776 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:26" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:26,876 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:26,876 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:26,876 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:26,877 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:26,880 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:26" (1/1) ... 2019-05-11 07:10:29,092 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:29,093 INFO [Benchmark.java:150]: Toolchain (without parser) took 2762.22 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 518.0 MB in the end (delta: 86.0 MB). Peak memory consumption was 89.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:29,096 INFO [Benchmark.java:150]: CDTParser took 112.35 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 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:29,097 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 115.29 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:10:29,098 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 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:29,098 INFO [Benchmark.java:150]: RCFGBuilder took 220.49 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 581.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:29,099 INFO [Benchmark.java:150]: BlockEncoding took 76.71 ms. Allocated memory is still 643.3 MB. Free memory was 581.8 MB in the beginning and 576.5 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:10:29,100 INFO [Benchmark.java:150]: TraceAbstraction took 103.92 ms. Allocated memory is still 643.3 MB. Free memory was 576.5 MB in the beginning and 569.8 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:29,101 INFO [Benchmark.java:150]: BuchiAutomizer took 2216.31 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 569.8 MB in the beginning and 518.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 54.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:29,107 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:29,108 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:29,108 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:29,108 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:29,108 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:29,109 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:29,109 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 14]: Procedure Contract for main 2019-05-11 07:10:29,109 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:29,109 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 23]: Loop Invariant 2019-05-11 07:10:29,110 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:29,110 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:29,110 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:10:29,110 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:29,110 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:29,111 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * N + -2 * x + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * x + 2 * N + 1 and consists of 5 locations. One deterministic module has affine ranking function 4 * N + -4 * x + 1 and consists of 7 locations. One nondeterministic module has affine ranking function 2 * N + -2 * x + 1 and consists of 5 locations. 2019-05-11 07:10:29,111 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:29,111 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !!(~x~2 <= ~N~2);" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "assume true;" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "assume !(~x~2 <= ~N~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume !(((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824);" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume !(~x~2 + ~y~2 >= 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "assume !true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "54#unseeded" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "28#false" "76#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" }, initialStates = {"54#unseeded" }, finalStates = {"64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "28#false" }, callTransitions = { ("54#unseeded" "call #t~ret4 := main();" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("54#unseeded" "call ULTIMATE.init();" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "assume !true;" "28#false") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume !!(~x~2 <= ~N~2);" "76#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "#res := 0;assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume !(~x~2 <= ~N~2);" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume !true;" "28#false") ("65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume true;" "65#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("54#unseeded" "assume true;" "54#unseeded") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume !(~x~2 + ~y~2 >= 0);" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume !(((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824);" "57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("28#false" "assume true;" "28#false") ("28#false" "#res := 0;assume true;" "28#false") ("28#false" "assume true;" "28#false") ("28#false" "assume true;" "28#false") ("76#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "64#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") }, returnTransitions = { ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "54#unseeded" "return;" "54#unseeded") ("57#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "54#unseeded" "return;" "54#unseeded") ("28#false" "54#unseeded" "return;" "28#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !!(~x~2 <= ~N~2);" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "assume true;" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "assume !(~x~2 <= ~N~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume !(((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824);" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume !(~x~2 + ~y~2 >= 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "assume !true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"209#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" "196#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "197#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "182#unseeded" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"182#unseeded" }, finalStates = {"196#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("182#unseeded" "call #t~ret4 := main();" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("182#unseeded" "call ULTIMATE.init();" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("209#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "196#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") ("196#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "assume true;" "197#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("197#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume true;" "197#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("197#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume !!(~x~2 <= ~N~2);" "209#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 <= ~N~2);" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "196#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "182#unseeded" "return;" "182#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !!(~x~2 <= ~N~2);" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "assume true;" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "assume !(~x~2 <= ~N~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume !(((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824);" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume !(~x~2 + ~y~2 >= 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "assume !true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"528#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "529#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "545#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" "514#unseeded" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"514#unseeded" }, finalStates = {"528#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("514#unseeded" "call #t~ret4 := main();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#unseeded" "call ULTIMATE.init();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("528#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))" "assume true;" "529#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("529#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume true;" "529#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))") ("529#(<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0))" "assume !!(~x~2 <= ~N~2);" "545#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))") ("545#(and (<= main_~x~2 main_~N~2) (<= (+ (* 2 main_~N~2) 1) (+ (* 2 main_~x~2) oldRank0)))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "528#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 <= ~N~2);" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "528#(and (<= (+ (* 2 main_~N~2) 2) (+ (* 2 main_~x~2) oldRank0)) (<= 0 oldRank0))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "514#unseeded" "return;" "514#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !!(~x~2 <= ~N~2);" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "assume true;" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "assume !(~x~2 <= ~N~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume !(((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824);" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume !(~x~2 + ~y~2 >= 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "assume !true;" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"659#unseeded" "675#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))" "681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" "668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "700#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= main_~x~2 main_~N~2) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" }, initialStates = {"659#unseeded" }, finalStates = {"680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))" }, callTransitions = { ("659#unseeded" "call #t~ret4 := main();" "662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("659#unseeded" "call ULTIMATE.init();" "662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("675#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "assume true;" "680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))") ("662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~N~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~N~2 := #t~nondet2;havoc #t~nondet2;assume ((~N~2 < 536870912 && ~x~2 < 536870912) && ~y~2 < 536870912) && ~x~2 >= -1073741824;assume ~x~2 + ~y~2 >= 0;" "668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))") ("680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))" "assume true;" "681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))") ("680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))" "assume true;" "681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))") ("681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" "assume true;" "681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))") ("681#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" "assume !!(~x~2 <= ~N~2);" "700#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= main_~x~2 main_~N~2) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))") ("668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "assume true;" "668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))") ("668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "assume !!(~x~2 <= ~N~2);" "668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))") ("668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "675#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))") ("668#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "675#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 0 (+ main_~x~2 main_~y~2)))") ("700#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= main_~x~2 main_~N~2) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" "assume !(#t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;" "680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))") ("700#(and (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= main_~x~2 main_~N~2) (<= (+ (* 4 main_~N~2) 1) (+ (* 4 main_~x~2) oldRank0)))" "assume #t~nondet3 != 0;havoc #t~nondet3;~x~2 := 2 * ~x~2 + ~y~2;~y~2 := ~y~2 + 1;" "680#(and (<= 0 oldRank0) (<= 1 (+ (* 2 main_~x~2) (* 2 main_~y~2))) (<= (+ (* 4 main_~N~2) 2) (+ (* 4 main_~x~2) oldRank0)))") }, returnTransitions = { ("662#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "659#unseeded" "return;" "659#unseeded") } ); 2019-05-11 07:10:29,112 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:29,113 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.1s and 5 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization removed 10 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 170 Sat,155 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Termination: inital20 mio100 ax100 hnf98 lsp81 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 Nontermination: inital20 mio100 ax100 hnf98 lsp81 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 155ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:10:29,113 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:29,113 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:29,114 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:29,114 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:29,120 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 112.35 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 115.29 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.20 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 220.49 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 581.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 53.1 GB * BlockEncoding took 76.71 ms. Allocated memory is still 643.3 MB. Free memory was 581.8 MB in the beginning and 576.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * TraceAbstraction took 103.92 ms. Allocated memory is still 643.3 MB. Free memory was 576.5 MB in the beginning and 569.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2216.31 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 569.8 MB in the beginning and 518.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 54.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:29,146 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully