YES 2019-05-11 07:09:55,237 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:55,241 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:55,244 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:55,244 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:55,245 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:55,246 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:55,246 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:55,246 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:55,247 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:55,249 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:55,249 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:55,250 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:55,250 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:55,250 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:55,250 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:55,252 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:57,072 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:57,072 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:57,072 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:57,073 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:57,419 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:57,419 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:57,420 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:57,420 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:57,420 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:57,420 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:57,420 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:57,421 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:57,421 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:57,421 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:57,421 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:57,421 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:57,421 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:57,422 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:57,422 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:57,422 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:57,422 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:57,422 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:57,423 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:57,423 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:57,423 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:57,423 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:57,423 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:57,423 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:57,424 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:57,424 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:57,424 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:57,424 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:57,424 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:57,424 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:57,425 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:57,425 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:57,425 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:57,425 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:57,426 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:57,639 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:57,645 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:57,646 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:57,648 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:57,649 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:57,650 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:57,650 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:57,771 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:57,772 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:57,773 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:57,773 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:57,776 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:57,777 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:57" (1/1) ... 2019-05-11 07:09:57,885 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:57,885 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:57,885 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:57,886 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:57,901 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:57" (1/1) ... 2019-05-11 07:09:57,906 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:57" (1/1) ... 2019-05-11 07:09:57,906 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:57" (1/1) ... 2019-05-11 07:09:57,908 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:57" (1/1) ... 2019-05-11 07:09:57,909 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:57" (1/1) ... 2019-05-11 07:09:57,910 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:57" (1/1) ... 2019-05-11 07:09:57,911 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:57,912 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:57,912 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:57,912 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:57,913 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:57" (1/1) ... 2019-05-11 07:09:58,010 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:58,012 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:58,135 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:58,135 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:58,135 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:58,137 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:58,137 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:58" (1/1) ... 2019-05-11 07:09:58,152 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:58" (1/1) ... 2019-05-11 07:09:58,200 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,201 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,202 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,203 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,204 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,204 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:58,205 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:58,206 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:58,206 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:58,207 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:58,207 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:57" (1/5) ... 2019-05-11 07:09:58,208 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:58" (2/5) ... 2019-05-11 07:09:58,209 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:58" (3/5) ... 2019-05-11 07:09:58,209 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:58" (4/5) ... 2019-05-11 07:09:58,209 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:57" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:58,304 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:58,304 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:58,305 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:58,306 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:58,308 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:58" (1/1) ... 2019-05-11 07:10:00,410 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:00,411 INFO [Benchmark.java:150]: Toolchain (without parser) took 2639.46 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 519.8 MB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,413 INFO [Benchmark.java:150]: CDTParser took 109.95 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:10:00,414 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.48 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:10:00,415 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,415 INFO [Benchmark.java:150]: RCFGBuilder took 223.22 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 587.7 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,416 INFO [Benchmark.java:150]: BlockEncoding took 70.43 ms. Allocated memory is still 649.6 MB. Free memory was 587.7 MB in the beginning and 582.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,417 INFO [Benchmark.java:150]: TraceAbstraction took 98.64 ms. Allocated memory is still 649.6 MB. Free memory was 582.4 MB in the beginning and 577.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,418 INFO [Benchmark.java:150]: BuchiAutomizer took 2105.45 ms. Allocated memory is still 649.6 MB. Free memory was 577.0 MB in the beginning and 519.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,424 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:10:00,425 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:00,425 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:00,425 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:00,425 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:00,425 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:10:00,425 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 23]: Loop Invariant 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:00,426 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * y + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. 2019-05-11 07:10:00,427 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:00,428 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret5 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;assume !(~x~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "assume true;assume !!(~x~2 >= 0);" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "99#unseeded" "102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)" }, initialStates = {"99#unseeded" }, finalStates = {"108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("99#unseeded" "call #t~ret5 := main();" "102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#unseeded" "call ULTIMATE.init();" "102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("108#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);" "112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("109#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("109#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("109#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;" "109#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("109#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;assume !!(~x~2 >= 0);" "112#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") }, returnTransitions = { ("102#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "99#unseeded" "return;" "99#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret5 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;assume !(~x~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "assume true;assume !!(~x~2 >= 0);" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "182#unseeded" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"182#unseeded" }, finalStates = {"192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("182#unseeded" "call #t~ret5 := main();" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("182#unseeded" "call ULTIMATE.init();" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "~x~2 := ~x~2 - 1;" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !!(~x~2 >= 0);" "193#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("193#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);" "192#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("185#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "182#unseeded" "return;" "182#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret5 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;assume !(~x~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "assume true;assume !!(~x~2 >= 0);" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "300#unseeded" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"300#unseeded" }, finalStates = {"315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("300#unseeded" "call #t~ret5 := main();" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("300#unseeded" "call ULTIMATE.init();" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "~x~2 := ~x~2 - 1;" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !!(~x~2 >= 0);" "316#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "315#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "300#unseeded" "return;" "300#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret5 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;assume !(~x~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "assume true;assume !!(~x~2 >= 0);" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"673#unseeded" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" }, initialStates = {"673#unseeded" }, finalStates = {"683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("673#unseeded" "call #t~ret5 := main();" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("673#unseeded" "call ULTIMATE.init();" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);" "683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "~x~2 := ~x~2 - 1;" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !!(~x~2 >= 0);" "684#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("684#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "683#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") }, returnTransitions = { ("676#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "673#unseeded" "return;" "673#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret5 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "assume true;" "assume true;assume !(~x~2 >= 0);" "#res := 0;assume true;" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "assume true;assume !!(~x~2 >= 0);" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "1144#unseeded" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"1144#unseeded" }, finalStates = {"1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("1144#unseeded" "call #t~ret5 := main();" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1144#unseeded" "call ULTIMATE.init();" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "~x~2 := ~x~2 - 1;" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))" "assume true;assume !!(~x~2 >= 0);" "1160#(<= (+ (* 2 main_~n~2) 1) (+ (* 2 main_~y~2) oldRank0))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "1159#(and (<= 0 oldRank0) (<= (+ (* 2 main_~n~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;~y~2 := ~y~2 + 1;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~x~2 := #t~nondet1;havoc #t~nondet1;~y~2 := #t~nondet2;havoc #t~nondet2;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 <= ~n~2 && #t~nondet4 != 0);havoc #t~nondet4;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= 0 && #t~nondet3 != 0);havoc #t~nondet3;~y~2 := ~y~2 - 1;" "1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("1147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1144#unseeded" "return;" "1144#unseeded") } ); 2019-05-11 07:10:00,429 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:00,429 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.0s and 7 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 37 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 14 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 231 Sat,239 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital16 mio100 ax100 hnf92 lsp76 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf99 smp100 dnf118 smp100 tf111 neg97 sie105 Nontermination: inital16 mio100 ax100 hnf92 lsp76 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf99 smp100 dnf118 smp100 tf111 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:10:00,429 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:00,430 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:00,430 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:00,430 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:00,436 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 109.95 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 112.48 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 26.07 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 223.22 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 587.7 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 53.1 GB * BlockEncoding took 70.43 ms. Allocated memory is still 649.6 MB. Free memory was 587.7 MB in the beginning and 582.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.64 ms. Allocated memory is still 649.6 MB. Free memory was 582.4 MB in the beginning and 577.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2105.45 ms. Allocated memory is still 649.6 MB. Free memory was 577.0 MB in the beginning and 519.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 53.1 GB 2019-05-11 07:10:00,462 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully