YES 2019-05-11 07:12:09,017 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:12:09,020 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:12:09,024 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:12:09,024 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:12:09,025 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:12:09,025 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:12:09,025 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:12:09,026 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:12:09,026 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:12:09,029 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:12:09,029 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:12:09,030 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:12:09,030 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:12:09,030 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:12:09,030 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:12:09,032 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:12:10,924 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:12:10,925 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:12:10,925 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:12:10,925 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:12:11,280 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:12:11,281 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:12:11,281 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:12:11,281 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:12:11,282 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:11,282 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:12:11,282 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:11,282 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:12:11,282 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:12:11,283 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:12:11,283 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:12:11,283 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:12:11,283 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:12:11,283 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:12:11,283 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:12:11,284 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:12:11,284 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:12:11,284 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:12:11,284 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:12:11,284 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:12:11,285 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:12:11,285 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:12:11,285 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:12:11,285 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:12:11,285 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:12:11,286 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:12:11,286 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:12:11,286 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:12:11,286 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:12:11,286 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:12:11,286 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:11,287 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:11,287 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:11,287 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:11,287 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:12:11,503 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:12:11,518 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:11,518 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:12:11,520 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:12:11,521 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:12:11,522 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:12:11,522 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:11,644 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:12:11,646 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:12:11,646 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:11,646 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:12:11,650 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:12:11,651 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:12:11" (1/1) ... 2019-05-11 07:12:11,758 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:11,759 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:12:11,759 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:12:11,759 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:12:11,775 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:12:11" (1/1) ... 2019-05-11 07:12:11,780 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:12:11" (1/1) ... 2019-05-11 07:12:11,780 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:12:11" (1/1) ... 2019-05-11 07:12:11,782 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:12:11" (1/1) ... 2019-05-11 07:12:11,783 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:12:11" (1/1) ... 2019-05-11 07:12:11,784 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:12:11" (1/1) ... 2019-05-11 07:12:11,785 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:12:11,785 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:12:11,785 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:12:11,786 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:12:11,787 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:11" (1/1) ... 2019-05-11 07:12:11,883 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:12:11,885 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:12:12,003 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:12:12,003 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:12:12,003 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:12:12,005 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:12:12,005 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:12" (1/1) ... 2019-05-11 07:12:12,020 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:12" (1/1) ... 2019-05-11 07:12:12,062 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:12,063 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:12,074 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:12,075 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:12,076 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:12:12,076 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:12:12,077 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:12:12,078 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:12:12,078 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:12:12" (1/5) ... 2019-05-11 07:12:12,079 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:12:11" (2/5) ... 2019-05-11 07:12:12,079 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:12" (3/5) ... 2019-05-11 07:12:12,080 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:12:12" (4/5) ... 2019-05-11 07:12:12,080 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:11" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:12:12,169 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:12:12,169 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:12:12,169 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:12:12,170 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:12:12,172 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:12:12" (1/1) ... 2019-05-11 07:12:14,503 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:12:14,504 INFO [Benchmark.java:150]: Toolchain (without parser) took 2859.04 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 461.2 MB in the end (delta: 142.9 MB). Peak memory consumption was 146.1 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,508 INFO [Benchmark.java:150]: CDTParser took 111.30 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:12:14,509 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.35 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:12:14,509 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.26 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:12:14,510 INFO [Benchmark.java:150]: RCFGBuilder took 217.68 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,511 INFO [Benchmark.java:150]: BlockEncoding took 73.01 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 577.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,512 INFO [Benchmark.java:150]: TraceAbstraction took 92.63 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,512 INFO [Benchmark.java:150]: BuchiAutomizer took 2333.85 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 461.2 MB in the end (delta: 109.3 MB). Peak memory consumption was 112.5 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,520 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:12:14,520 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:12:14,520 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:12:14,520 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:12:14,521 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 20]: Loop Invariant 2019-05-11 07:12:14,522 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:12:14,522 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:12:14,522 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:12:14,522 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:12:14,522 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:12:14,522 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 6 locations. One deterministic module has affine ranking function 2 * y + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:12:14,522 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:12:14,523 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "467#unseeded" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" }, initialStates = {"467#unseeded" }, finalStates = {"480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("467#unseeded" "call #t~ret3 := main();" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("467#unseeded" "call ULTIMATE.init();" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~y~2 := ~y~2 - 1;" "480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "467#unseeded" "return;" "467#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "55#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "26#false" "60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "45#unseeded" }, initialStates = {"45#unseeded" }, finalStates = {"54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "26#false" }, callTransitions = { ("45#unseeded" "call #t~ret3 := main();" "48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("45#unseeded" "call ULTIMATE.init();" "48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume !true;" "26#false") ("54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "55#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("55#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "#res := 0;assume true;" "55#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("26#false" "assume !true;" "26#false") ("26#false" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "26#false") ("26#false" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "26#false") ("26#false" "~x~2 := ~x~2 - 1;" "26#false") ("26#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "26#false") ("26#false" "assume !true;" "26#false") ("26#false" "~y~2 := ~y~2 - 1;" "26#false") ("26#false" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("26#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "26#false") ("26#false" "assume true;" "26#false") ("60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume !true;" "26#false") ("60#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~y~2 := ~y~2 - 1;" "54#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("48#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "45#unseeded" "return;" "45#unseeded") ("26#false" "45#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "163#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))" "148#unseeded" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "122#false" }, initialStates = {"148#unseeded" }, finalStates = {"162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "122#false" }, callTransitions = { ("148#unseeded" "call #t~ret3 := main();" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("148#unseeded" "call ULTIMATE.init();" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "163#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume !true;" "122#false") ("163#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))" "~x~2 := ~x~2 - 1;" "163#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "162#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("122#false" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "122#false") ("122#false" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "122#false") ("122#false" "~x~2 := ~x~2 - 1;" "122#false") ("122#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "122#false") ("122#false" "assume !true;" "122#false") ("122#false" "~y~2 := ~y~2 - 1;" "122#false") ("122#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "122#false") }, returnTransitions = { ("151#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "148#unseeded" "return;" "148#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"256#unseeded" "272#(<= main_~x~2 oldRank0)" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "213#false" "271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, initialStates = {"256#unseeded" }, finalStates = {"213#false" "271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("256#unseeded" "call #t~ret3 := main();" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("256#unseeded" "call ULTIMATE.init();" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("272#(<= main_~x~2 oldRank0)" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "272#(<= main_~x~2 oldRank0)") ("272#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "272#(<= main_~x~2 oldRank0)") ("272#(<= main_~x~2 oldRank0)" "~x~2 := ~x~2 - 1;" "277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") ("272#(<= main_~x~2 oldRank0)" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "272#(<= main_~x~2 oldRank0)") ("272#(<= main_~x~2 oldRank0)" "assume !true;" "213#false") ("272#(<= main_~x~2 oldRank0)" "~y~2 := ~y~2 - 1;" "272#(<= main_~x~2 oldRank0)") ("272#(<= main_~x~2 oldRank0)" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "272#(<= main_~x~2 oldRank0)") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "~y~2 := ~y~2 - 1;" "277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") ("277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("213#false" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "213#false") ("213#false" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "213#false") ("213#false" "~x~2 := ~x~2 - 1;" "213#false") ("213#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "213#false") ("213#false" "assume !true;" "213#false") ("213#false" "~y~2 := ~y~2 - 1;" "213#false") ("213#false" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "213#false") ("271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "272#(<= main_~x~2 oldRank0)") ("271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "272#(<= main_~x~2 oldRank0)") ("271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~x~2 := ~x~2 - 1;" "277#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))") ("271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !true;" "213#false") ("271#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~y~2 := ~y~2 - 1;" "272#(<= main_~x~2 oldRank0)") }, returnTransitions = { ("259#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "256#unseeded" "return;" "256#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "467#unseeded" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" }, initialStates = {"467#unseeded" }, finalStates = {"480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("467#unseeded" "call #t~ret3 := main();" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("467#unseeded" "call ULTIMATE.init();" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("486#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~y~2 := ~y~2 - 1;" "480#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("470#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "467#unseeded" "return;" "467#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "983#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))" "971#unseeded" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"971#unseeded" }, finalStates = {"982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("971#unseeded" "call #t~ret3 := main();" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("971#unseeded" "call ULTIMATE.init();" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "983#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("983#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))" "~x~2 := ~x~2 - 1;" "983#(<= (+ (* 2 main_~m~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "982#(and (<= 0 oldRank0) (<= (+ (* 2 main_~m~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("974#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "971#unseeded" "return;" "971#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;" "assume !true;" "assume true;assume !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "~y~2 := ~y~2 - 1;" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" }, returnAlphabet = {"return;" "return;" }, states = {"1408#unseeded" "1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" }, initialStates = {"1408#unseeded" }, finalStates = {"1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("1408#unseeded" "call #t~ret3 := main();" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1408#unseeded" "call ULTIMATE.init();" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 + 1;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~m~2;~y~2 := 0;~m~2 := #t~nondet0;havoc #t~nondet0;~x~2 := ~m~2;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume !(#t~nondet1 != 0);havoc #t~nondet1;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0 && ~y~2 >= 0);assume #t~nondet1 != 0;havoc #t~nondet1;" "1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "assume true;assume !(~y~2 <= ~m~2 && #t~nondet2 != 0);havoc #t~nondet2;" "1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))") ("1430#(and (<= 0 main_~y~2) (<= (+ (* 2 main_~y~2) 1) oldRank0))" "~y~2 := ~y~2 - 1;" "1425#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("1411#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1408#unseeded" "return;" "1408#unseeded") } ); 2019-05-11 07:12:14,524 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:12:14,526 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.3s and 7 iterations. Analysis of lassos took 0.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization removed 55 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 6/7 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 12 SDtfs, 4 SDslu, 15 SDs, 0 lazy, 258 Sat,251 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital17 mio100 ax100 hnf96 lsp67 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf95 smp100 dnf107 smp100 tf111 neg99 sie101 Nontermination: inital17 mio100 ax100 hnf96 lsp67 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf95 smp100 dnf107 smp100 tf111 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:12:14,526 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:12:14,526 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:12:14,526 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:12:14,526 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:12:14,533 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.30 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 112.35 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.26 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 217.68 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB * BlockEncoding took 73.01 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 577.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 92.63 ms. Allocated memory is still 643.3 MB. Free memory was 577.2 MB in the beginning and 570.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2333.85 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 570.5 MB in the beginning and 461.2 MB in the end (delta: 109.3 MB). Peak memory consumption was 112.5 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,559 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully