YES 2019-05-11 07:09:07,493 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:07,496 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:07,500 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:07,500 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:07,501 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:07,501 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:07,501 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:07,502 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:07,502 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:07,504 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:07,505 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:07,505 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:07,505 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:07,505 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:07,506 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:07,508 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:10,197 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:10,198 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:10,198 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:10,198 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:10,556 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:10,556 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:10,557 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:10,557 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:10,557 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:10,557 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:10,558 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:10,558 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:10,558 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:10,558 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:10,559 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:10,559 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:10,559 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:10,559 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:10,559 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:10,560 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:10,560 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:10,560 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:10,560 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:10,560 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:10,561 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:10,561 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:10,561 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:10,561 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:10,561 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:10,562 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:10,562 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:10,562 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:10,562 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:10,562 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:10,563 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:10,563 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:10,563 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:10,563 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:10,564 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:10,782 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:10,790 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:10,790 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:10,793 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:10,794 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:10,794 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:10,795 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:10,925 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:10,927 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:10,928 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:10,928 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:10,932 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:10,932 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:10" (1/1) ... 2019-05-11 07:09:11,041 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:11,041 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:11,060 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:11,060 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:11,077 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:09:11" (1/1) ... 2019-05-11 07:09:11,082 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:09:11" (1/1) ... 2019-05-11 07:09:11,082 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:09:11" (1/1) ... 2019-05-11 07:09:11,084 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:09:11" (1/1) ... 2019-05-11 07:09:11,085 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:09:11" (1/1) ... 2019-05-11 07:09:11,086 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:09:11" (1/1) ... 2019-05-11 07:09:11,087 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:11,088 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:11,088 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:11,088 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:11,090 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:11" (1/1) ... 2019-05-11 07:09:11,185 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:09:11,188 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:09:11,299 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:11,300 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:11,300 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:11,301 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:11,302 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:11" (1/1) ... 2019-05-11 07:09:11,316 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:11" (1/1) ... 2019-05-11 07:09:11,335 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:11,336 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:11,362 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:11,362 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:11,362 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:11,364 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:11,364 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:11" (1/5) ... 2019-05-11 07:09:11,366 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:11" (2/5) ... 2019-05-11 07:09:11,366 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:11" (3/5) ... 2019-05-11 07:09:11,367 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:11" (4/5) ... 2019-05-11 07:09:11,367 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:10" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:11,460 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:11,460 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:11,460 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:11,461 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:11,463 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:11" (1/1) ... 2019-05-11 07:09:13,483 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:13,484 INFO [Benchmark.java:150]: Toolchain (without parser) took 2558.33 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 573.2 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,486 INFO [Benchmark.java:150]: CDTParser took 119.44 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,487 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 113.28 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,488 INFO [Benchmark.java:150]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.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:09:13,489 INFO [Benchmark.java:150]: RCFGBuilder took 211.95 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,490 INFO [Benchmark.java:150]: BlockEncoding took 61.96 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,490 INFO [Benchmark.java:150]: TraceAbstraction took 98.09 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,491 INFO [Benchmark.java:150]: BuchiAutomizer took 2022.99 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 573.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,497 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:09:13,498 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:13,498 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:13,498 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:13,498 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:13,498 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:13,499 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 15]: Procedure Contract for main 2019-05-11 07:09:13,499 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:13,499 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 21]: Loop Invariant 2019-05-11 07:09:13,499 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:13,499 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:13,499 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:09:13,500 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:13,500 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:13,500 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * y + 2 * x + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * y + 2 * x + 1 and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * z + 0 > 0 then 1 else 0), (if 2 * z + 0 > 0 then 2 * z + 0 else 2 * z + 2 * x + -2 * y + 1) and consists of 5 locations. One nondeterministic module has affine ranking function -2 * y + 2 * x + 1 and consists of 5 locations. 2019-05-11 07:09:13,500 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:13,500 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;" "assume true;" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "73#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "26#false" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" }, initialStates = {"52#unseeded" }, finalStates = {"26#false" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("52#unseeded" "call #t~ret6 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("73#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume !true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !true;" "26#false") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "#res := 0;assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "73#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("26#false" "52#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;" "assume true;" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" }, returnAlphabet = {"return;" "return;" }, states = {"196#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "183#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "184#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "169#unseeded" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"169#unseeded" }, finalStates = {"183#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("169#unseeded" "call #t~ret6 := main();" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("169#unseeded" "call ULTIMATE.init();" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("196#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "183#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("183#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "184#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("184#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "184#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("184#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "196#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "183#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "169#unseeded" "return;" "169#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;" "assume true;" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" }, returnAlphabet = {"return;" "return;" }, states = {"528#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "544#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "513#unseeded" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "527#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, initialStates = {"513#unseeded" }, finalStates = {"527#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("513#unseeded" "call #t~ret6 := main();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("513#unseeded" "call ULTIMATE.init();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("528#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "528#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("528#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "544#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))") ("544#(and (<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= main_~y~2 main_~x~2))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "527#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "527#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("527#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;" "528#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~y~2) oldRank0))") }, returnTransitions = { ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "513#unseeded" "return;" "513#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;" "assume true;" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" }, returnAlphabet = {"return;" "return;" }, states = {"661#unseeded" "677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "697#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (exists ((main_~tx~2 Int)) (or (and (<= 1 (* 2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) oldRank1) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= main_~x~2 (+ main_~tx~2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) 0) (<= (+ (* 2 main_~tx~2) (* 2 main_~z~2) 1) (+ (* 2 main_~y~2) oldRank1))))))" }, initialStates = {"661#unseeded" }, finalStates = {"677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))" }, callTransitions = { ("661#unseeded" "call #t~ret6 := main();" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("661#unseeded" "call ULTIMATE.init();" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))" "assume true;" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))") ("677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))" "assume true;" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))") ("678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))" "assume true;" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))") ("678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))" "assume true;" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))") ("678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "697#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (exists ((main_~tx~2 Int)) (or (and (<= 1 (* 2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) oldRank1) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= main_~x~2 (+ main_~tx~2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) 0) (<= (+ (* 2 main_~tx~2) (* 2 main_~z~2) 1) (+ (* 2 main_~y~2) oldRank1))))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~tx~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~tx~2 := #t~nondet3;havoc #t~nondet3;" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= ~y~2 && ~x~2 <= ~tx~2 + ~z~2);" "664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (exists ((main_~tx~2 Int)) (or (and (<= 1 (* 2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) oldRank1) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= main_~x~2 (+ main_~tx~2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) 0) (<= (+ (* 2 main_~tx~2) (* 2 main_~z~2) 1) (+ (* 2 main_~y~2) oldRank1))))))" "assume !(#t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "678#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)))") ("697#(and (>= oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (exists ((main_~tx~2 Int)) (or (and (<= 1 (* 2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) oldRank1) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= main_~x~2 (+ main_~tx~2 main_~z~2)) (<= main_~y~2 main_~x~2) (<= (* 2 main_~z~2) 0) (<= (+ (* 2 main_~tx~2) (* 2 main_~z~2) 1) (+ (* 2 main_~y~2) oldRank1))))))" "assume #t~nondet4 != 0;havoc #t~nondet4;~z~2 := ~z~2 - 1;~tx~2 := ~x~2;~x~2 := #t~nondet5;havoc #t~nondet5;" "677#(or (and (> oldRank1 (ite (<= 1 (* 2 main_~z~2)) (+ (* main_~z~2 2) 0) (+ (* main_~z~2 2) (* 2 main_~tx~2) (* main_~y~2 (- 2)) 1))) (>= oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0)) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= 1 (* 2 main_~z~2)) 1 0))))") }, returnTransitions = { ("664#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "661#unseeded" "return;" "661#unseeded") } ); 2019-05-11 07:09:13,501 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:13,502 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.9s and 5 iterations. Analysis of lassos took 0.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization removed 10 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 152 Sat,137 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital19 mio100 ax100 hnf99 lsp84 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 Nontermination: inital19 mio100 ax100 hnf99 lsp84 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:09:13,502 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:13,502 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:13,503 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:13,503 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:13,509 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 119.44 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 113.28 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 45.81 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 211.95 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB * BlockEncoding took 61.96 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.09 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2022.99 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 573.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:13,535 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully