YES 2019-05-11 07:10:53,884 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:53,887 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:53,890 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:53,891 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:53,892 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:53,892 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:53,892 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:53,893 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:53,893 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:53,895 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:53,896 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:53,896 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:53,896 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:53,897 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:53,897 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:53,898 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:55,673 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:55,673 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:55,673 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:55,674 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:56,024 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:56,025 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:56,025 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:56,025 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:56,026 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:56,026 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:56,026 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:56,026 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:56,026 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:56,027 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:56,027 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:56,027 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:56,027 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:56,027 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:56,027 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:56,028 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:56,028 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:56,028 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:56,028 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:56,028 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:56,029 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:56,029 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:56,029 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:56,029 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:56,029 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:56,029 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:56,030 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:56,030 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:56,030 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:56,030 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:56,030 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:56,031 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:56,031 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:56,031 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:56,031 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:56,262 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:56,269 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:56,269 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:56,272 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:56,273 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:56,273 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:56,274 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:56,400 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:56,402 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:56,402 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:56,402 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:56,406 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:56,406 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,515 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:56,516 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:56,516 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:56,516 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:56,531 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,535 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,536 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,537 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,539 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,539 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,540 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:56,541 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:56,541 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:56,541 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:56,542 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,634 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:10:56,636 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:56,736 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:56,736 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:56,737 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:56,740 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:56,741 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,753 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:56,768 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:56,769 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:56,785 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:56,785 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:56,785 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:56,786 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:56,787 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:56" (1/5) ... 2019-05-11 07:10:56,787 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:56" (2/5) ... 2019-05-11 07:10:56,788 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:10:56" (3/5) ... 2019-05-11 07:10:56,788 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:56" (4/5) ... 2019-05-11 07:10:56,789 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:56" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:56,881 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:56,881 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:56,881 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:56,881 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:56,884 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:10:56" (1/1) ... 2019-05-11 07:10:58,542 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:58,543 INFO [Benchmark.java:150]: Toolchain (without parser) took 2142.61 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 367.6 MB in the end (delta: 242.6 MB). Peak memory consumption was 242.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:58,545 INFO [Benchmark.java:150]: CDTParser took 114.91 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.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:10:58,546 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 113.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:10:58,547 INFO [Benchmark.java:150]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 649.6 MB. Free memory was 606.1 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:10:58,548 INFO [Benchmark.java:150]: RCFGBuilder took 195.53 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:58,548 INFO [Benchmark.java:150]: BlockEncoding took 48.64 ms. Allocated memory is still 649.6 MB. Free memory was 589.7 MB in the beginning and 585.6 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:10:58,549 INFO [Benchmark.java:150]: TraceAbstraction took 95.56 ms. Allocated memory is still 649.6 MB. Free memory was 585.6 MB in the beginning and 580.2 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:58,550 INFO [Benchmark.java:150]: BuchiAutomizer took 1661.32 ms. Allocated memory is still 649.6 MB. Free memory was 580.2 MB in the beginning and 367.6 MB in the end (delta: 212.6 MB). Peak memory consumption was 212.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:58,556 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:58,557 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:58,557 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:58,557 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:58,557 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:58,557 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:58,557 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:10:58,558 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:58,558 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:10:58,558 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:58,558 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:58,559 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:10:58,559 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:58,559 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:58,559 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 * x + 1 and consists of 6 locations. 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 nondeterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. 2019-05-11 07:10:58,559 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:58,559 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 >= 0);" "assume true;" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 >= 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"53#unseeded" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "26#false" "74#(exists ((v_main_~x~2_16 Int)) (and (<= main_~x~2 (+ main_~y~2 v_main_~x~2_16)) (<= (+ (* 2 v_main_~x~2_16) 1) oldRank0) (<= 0 v_main_~x~2_16)))" "62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" }, initialStates = {"53#unseeded" }, finalStates = {"26#false" "62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("53#unseeded" "call #t~ret2 := main();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("53#unseeded" "call ULTIMATE.init();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("74#(exists ((v_main_~x~2_16 Int)) (and (<= main_~x~2 (+ main_~y~2 v_main_~x~2_16)) (<= (+ (* 2 v_main_~x~2_16) 1) oldRank0) (<= 0 v_main_~x~2_16)))" "assume !(~y~2 >= 0);" "62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume !true;" "26#false") ("62#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume !(~x~2 >= 0);" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume !true;" "26#false") ("63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "#res := 0;assume true;" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;" "63#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("63#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "74#(exists ((v_main_~x~2_16 Int)) (and (<= main_~x~2 (+ main_~y~2 v_main_~x~2_16)) (<= (+ (* 2 v_main_~x~2_16) 1) oldRank0) (<= 0 v_main_~x~2_16)))") }, returnTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "53#unseeded" "return;" "53#unseeded") ("26#false" "53#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 >= 0);" "assume true;" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 >= 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"194#(exists ((v_main_~x~2_21 Int)) (and (<= (+ (* 2 v_main_~x~2_21) 1) oldRank0) (<= main_~x~2 (+ main_~y~2 v_main_~x~2_21)) (<= 0 v_main_~x~2_21)))" "181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "182#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "167#unseeded" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"167#unseeded" }, finalStates = {"181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("167#unseeded" "call #t~ret2 := main();" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#unseeded" "call ULTIMATE.init();" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("194#(exists ((v_main_~x~2_21 Int)) (and (<= (+ (* 2 v_main_~x~2_21) 1) oldRank0) (<= main_~x~2 (+ main_~y~2 v_main_~x~2_21)) (<= 0 v_main_~x~2_21)))" "assume !(~y~2 >= 0);" "181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;" "182#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("182#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;" "182#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("182#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "194#(exists ((v_main_~x~2_21 Int)) (and (<= (+ (* 2 v_main_~x~2_21) 1) oldRank0) (<= main_~x~2 (+ main_~y~2 v_main_~x~2_21)) (<= 0 v_main_~x~2_21)))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 >= 0);" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "167#unseeded" "return;" "167#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 >= 0);" "assume true;" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 >= 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "507#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "508#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "524#(exists ((v_main_~x~2_35 Int)) (and (<= (+ (* 2 v_main_~x~2_35) 1) oldRank0) (<= 0 v_main_~x~2_35) (<= main_~x~2 (+ v_main_~x~2_35 main_~y~2))))" "493#unseeded" }, initialStates = {"493#unseeded" }, finalStates = {"507#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("493#unseeded" "call #t~ret2 := main();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("493#unseeded" "call ULTIMATE.init();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 >= 0);" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "507#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("507#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;" "508#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("508#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;" "508#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("508#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "524#(exists ((v_main_~x~2_35 Int)) (and (<= (+ (* 2 v_main_~x~2_35) 1) oldRank0) (<= 0 v_main_~x~2_35) (<= main_~x~2 (+ v_main_~x~2_35 main_~y~2))))") ("524#(exists ((v_main_~x~2_35 Int)) (and (<= (+ (* 2 v_main_~x~2_35) 1) oldRank0) (<= 0 v_main_~x~2_35) (<= main_~x~2 (+ v_main_~x~2_35 main_~y~2))))" "assume !(~y~2 >= 0);" "507#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") }, returnTransitions = { ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "493#unseeded" "return;" "493#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 >= 0);" "assume true;" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 >= 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"630#unseeded" "646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"630#unseeded" }, finalStates = {"646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" }, callTransitions = { ("630#unseeded" "call #t~ret2 := main();" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("630#unseeded" "call ULTIMATE.init();" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))" "assume true;" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !(~y~2 >= 0);" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume true;" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("647#(<= (+ (* 2 main_~y~2) 1) oldRank0)" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "647#(<= (+ (* 2 main_~y~2) 1) oldRank0)") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 >= 0);" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "646#(and (<= 0 oldRank0) (<= (+ (* 2 main_~y~2) 2) oldRank0))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 >= 0;~y~2 := ~y~2 - 1;" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 >= 0);~x~2 := ~x~2 + ~y~2;" "633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("633#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "630#unseeded" "return;" "630#unseeded") } ); 2019-05-11 07:10:58,560 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:58,561 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.6s and 5 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization removed 10 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 152 Sat,131 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital15 mio100 ax100 hnf105 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 Nontermination: inital15 mio100 ax100 hnf105 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:10:58,561 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:58,561 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:58,562 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:58,562 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:58,568 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 114.91 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 113.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.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 24.93 ms. Allocated memory is still 649.6 MB. Free memory was 606.1 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 195.53 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 53.1 GB * BlockEncoding took 48.64 ms. Allocated memory is still 649.6 MB. Free memory was 589.7 MB in the beginning and 585.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 95.56 ms. Allocated memory is still 649.6 MB. Free memory was 585.6 MB in the beginning and 580.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1661.32 ms. Allocated memory is still 649.6 MB. Free memory was 580.2 MB in the beginning and 367.6 MB in the end (delta: 212.6 MB). Peak memory consumption was 212.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:58,594 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully