YES 2019-05-11 07:11:39,060 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:39,063 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,067 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,067 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:39,068 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:39,068 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:39,069 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:39,069 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:39,069 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:39,072 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:39,072 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:39,072 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:39,072 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:39,073 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:39,073 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,074 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:41,225 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:41,225 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:41,225 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,225 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:41,575 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:41,576 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,576 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:41,576 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:41,577 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,577 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:41,577 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,577 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:41,578 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:41,578 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:41,578 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:41,578 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:41,578 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:41,579 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:41,579 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:41,579 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:41,579 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:41,579 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:41,580 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:41,580 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:41,580 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:41,580 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:41,580 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:41,581 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:41,581 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:41,581 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:41,581 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:41,581 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:41,581 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:41,582 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:41,582 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,582 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,582 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,582 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,583 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:41,798 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:41,804 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:41,805 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:41,807 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:41,808 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:41,809 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:41,809 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:41,930 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:41,932 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:41,932 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,932 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:41,936 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:41,936 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:42,043 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:42,044 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:42,044 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:42,044 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:42,060 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,065 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,065 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,067 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,069 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,070 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,071 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:42,071 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:42,072 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:42,072 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:42,073 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,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:11:42,170 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:42,275 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:42,275 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:42,275 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:42,277 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:42,277 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,290 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,304 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,305 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,323 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:42,324 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:42,324 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:42,325 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:42,326 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:41" (1/5) ... 2019-05-11 07:11:42,326 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:42" (2/5) ... 2019-05-11 07:11:42,327 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:42" (3/5) ... 2019-05-11 07:11:42,327 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:42" (4/5) ... 2019-05-11 07:11:42,328 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:42,419 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:42,419 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:42,419 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:42,419 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:42,421 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:43,742 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:43,743 INFO [Benchmark.java:150]: Toolchain (without parser) took 1812.26 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 416.0 MB in the end (delta: 188.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,745 INFO [Benchmark.java:150]: CDTParser took 110.36 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,746 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.33 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,747 INFO [Benchmark.java:150]: Boogie Preprocessor took 27.36 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,747 INFO [Benchmark.java:150]: RCFGBuilder took 203.58 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 584.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,748 INFO [Benchmark.java:150]: BlockEncoding took 48.41 ms. Allocated memory is still 643.3 MB. Free memory was 584.6 MB in the beginning and 580.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,749 INFO [Benchmark.java:150]: TraceAbstraction took 94.98 ms. Allocated memory is still 643.3 MB. Free memory was 580.6 MB in the beginning and 575.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,750 INFO [Benchmark.java:150]: BuchiAutomizer took 1323.35 ms. Allocated memory is still 643.3 MB. Free memory was 575.2 MB in the beginning and 416.0 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,756 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:11:43,757 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:43,757 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:43,757 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:43,757 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:43,757 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:43,757 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 16]: Loop Invariant 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:95]: CFG has 13 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 13 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:11:43,758 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:43,759 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:43,759 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + 0 and consists of 5 locations. One deterministic module has affine ranking function -1 * x + 0 and consists of 4 locations. One deterministic module has affine ranking function x + 0 and consists of 4 locations. One deterministic module has affine ranking function x + 0 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. 2019-05-11 07:11:43,759 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:43,759 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"192#unseeded" "208#(<= 0 (+ main_~x~2 oldRank0))" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" }, initialStates = {"192#unseeded" }, finalStates = {"207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" }, callTransitions = { ("192#unseeded" "call #t~ret1 := main();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("192#unseeded" "call ULTIMATE.init();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "208#(<= 0 (+ main_~x~2 oldRank0))") ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0);" "208#(<= 0 (+ main_~x~2 oldRank0))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0);" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "208#(<= 0 (+ main_~x~2 oldRank0))") }, returnTransitions = { ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "192#unseeded" "return;" "192#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "488#(<= main_~x~2 oldRank0)" "474#unseeded" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"474#unseeded" }, finalStates = {"487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("474#unseeded" "call #t~ret1 := main();" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("474#unseeded" "call ULTIMATE.init();" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "488#(<= main_~x~2 oldRank0)") ("487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "488#(<= main_~x~2 oldRank0)") ("488#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("488#(<= main_~x~2 oldRank0)" "assume true;" "488#(<= main_~x~2 oldRank0)") ("488#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != 0);" "488#(<= main_~x~2 oldRank0)") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0);" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "474#unseeded" "return;" "474#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"51#unseeded" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "26#false" "60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "61#(<= 0 (+ main_~x~2 oldRank0))" }, initialStates = {"51#unseeded" }, finalStates = {"26#false" "60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" }, callTransitions = { ("51#unseeded" "call #t~ret1 := main();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("51#unseeded" "call ULTIMATE.init();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "61#(<= 0 (+ main_~x~2 oldRank0))") ("60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume !true;" "26#false") ("60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "61#(<= 0 (+ main_~x~2 oldRank0))") ("61#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "60#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("61#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 != 0);" "61#(<= 0 (+ main_~x~2 oldRank0))") ("61#(<= 0 (+ main_~x~2 oldRank0))" "assume !true;" "26#false") ("61#(<= 0 (+ main_~x~2 oldRank0))" "#res := 0;assume true;" "61#(<= 0 (+ main_~x~2 oldRank0))") ("61#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "61#(<= 0 (+ main_~x~2 oldRank0))") ("61#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0);" "61#(<= 0 (+ main_~x~2 oldRank0))") }, returnTransitions = { ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "51#unseeded" "return;" "51#unseeded") ("26#false" "51#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"192#unseeded" "208#(<= 0 (+ main_~x~2 oldRank0))" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" }, initialStates = {"192#unseeded" }, finalStates = {"207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" }, callTransitions = { ("192#unseeded" "call #t~ret1 := main();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("192#unseeded" "call ULTIMATE.init();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume true;" "208#(<= 0 (+ main_~x~2 oldRank0))") ("208#(<= 0 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != 0);" "208#(<= 0 (+ main_~x~2 oldRank0))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0);" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("207#(and (<= 0 oldRank0) (<= 1 (+ main_~x~2 oldRank0)))" "assume true;" "208#(<= 0 (+ main_~x~2 oldRank0))") }, returnTransitions = { ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "192#unseeded" "return;" "192#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "344#(<= main_~x~2 oldRank0)" "333#unseeded" }, initialStates = {"333#unseeded" }, finalStates = {"343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("333#unseeded" "call #t~ret1 := main();" "336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("333#unseeded" "call ULTIMATE.init();" "336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "344#(<= main_~x~2 oldRank0)") ("343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !!(~x~2 != 0);" "344#(<= main_~x~2 oldRank0)") ("344#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "343#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("344#(<= main_~x~2 oldRank0)" "assume true;" "344#(<= main_~x~2 oldRank0)") ("344#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != 0);" "344#(<= main_~x~2 oldRank0)") }, returnTransitions = { ("336#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "333#unseeded" "return;" "333#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "assume true;" "assume true;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "assume !(~x~2 != 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 != 0);" }, returnAlphabet = {"return;" "return;" }, states = {"487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "488#(<= main_~x~2 oldRank0)" "474#unseeded" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"474#unseeded" }, finalStates = {"487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("474#unseeded" "call #t~ret1 := main();" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("474#unseeded" "call ULTIMATE.init();" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "488#(<= main_~x~2 oldRank0)") ("487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "488#(<= main_~x~2 oldRank0)") ("488#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("488#(<= main_~x~2 oldRank0)" "assume true;" "488#(<= main_~x~2 oldRank0)") ("488#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != 0);" "488#(<= main_~x~2 oldRank0)") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > 0);~x~2 := ~x~2 + 1;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "487#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;~x~2 := #t~nondet0;havoc #t~nondet0;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != 0);" "477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("477#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "474#unseeded" "return;" "474#unseeded") } ); 2019-05-11 07:11:43,760 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:43,761 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.2s and 5 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization removed 16 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 6/7 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 19 SDtfs, 1 SDslu, 25 SDs, 0 lazy, 111 Sat,73 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital12 mio100 ax100 hnf93 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf99 smp85 dnf100 smp100 tf112 neg100 sie100 Nontermination: inital12 mio100 ax100 hnf93 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf99 smp85 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:43,761 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:43,761 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:43,761 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:43,761 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:43,768 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.36 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.33 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 27.36 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 203.58 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 584.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 53.1 GB * BlockEncoding took 48.41 ms. Allocated memory is still 643.3 MB. Free memory was 584.6 MB in the beginning and 580.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 94.98 ms. Allocated memory is still 643.3 MB. Free memory was 580.6 MB in the beginning and 575.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1323.35 ms. Allocated memory is still 643.3 MB. Free memory was 575.2 MB in the beginning and 416.0 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,794 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully