YES 2019-05-11 07:10:39,777 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:39,780 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,783 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,784 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:39,784 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:39,785 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:39,785 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:39,785 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:39,786 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:39,788 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:39,788 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:39,789 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:39,789 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:39,789 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:39,789 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:39,791 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:41,905 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:41,906 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:41,906 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:41,906 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:42,253 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:42,254 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:42,254 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:42,254 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:42,254 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,255 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:42,255 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,255 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:42,255 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:42,255 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:42,256 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:42,256 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:42,256 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:42,256 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:42,256 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:42,256 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:42,257 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:42,257 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:42,257 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:42,257 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:42,257 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:42,258 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:42,258 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:42,258 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:42,258 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:42,258 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:42,258 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:42,259 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:42,259 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:42,259 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:42,259 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,259 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,259 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,260 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,260 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:42,475 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:42,481 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:42,481 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:42,484 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:42,485 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:42,485 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:42,486 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:10:42,607 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:42,609 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:42,609 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:42,610 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:42,613 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:42,614 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:42" (1/1) ... 2019-05-11 07:10:42,721 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:42,721 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:42,721 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:42,722 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:42,737 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:42" (1/1) ... 2019-05-11 07:10:42,742 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:42" (1/1) ... 2019-05-11 07:10:42,742 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:42" (1/1) ... 2019-05-11 07:10:42,744 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:42" (1/1) ... 2019-05-11 07:10:42,745 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:42" (1/1) ... 2019-05-11 07:10:42,746 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:42" (1/1) ... 2019-05-11 07:10:42,747 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:42,747 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:42,747 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:42,747 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:42,749 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:42" (1/1) ... 2019-05-11 07:10:42,847 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:42,849 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:42,973 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:42,974 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:42,974 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:42,975 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:42,976 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:42" (1/1) ... 2019-05-11 07:10:42,990 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:42" (1/1) ... 2019-05-11 07:10:43,029 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,030 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,036 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,037 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,039 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,040 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,041 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:43,041 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:43,041 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:43,042 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:43,043 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:42" (1/5) ... 2019-05-11 07:10:43,044 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:43" (2/5) ... 2019-05-11 07:10:43,044 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:42" (3/5) ... 2019-05-11 07:10:43,044 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:42" (4/5) ... 2019-05-11 07:10:43,045 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:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:43,136 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:43,137 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:43,137 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:43,137 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:43,140 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:44,074 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:44,075 INFO [Benchmark.java:150]: Toolchain (without parser) took 1466.53 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 471.5 MB in the end (delta: 132.6 MB). Peak memory consumption was 132.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,077 INFO [Benchmark.java:150]: CDTParser took 111.12 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,078 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.61 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,078 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.65 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,079 INFO [Benchmark.java:150]: RCFGBuilder took 226.58 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,080 INFO [Benchmark.java:150]: BlockEncoding took 66.95 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 575.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,081 INFO [Benchmark.java:150]: TraceAbstraction took 95.54 ms. Allocated memory is still 643.3 MB. Free memory was 575.8 MB in the beginning and 569.2 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:44,081 INFO [Benchmark.java:150]: BuchiAutomizer took 936.93 ms. Allocated memory is still 643.3 MB. Free memory was 569.2 MB in the beginning and 471.5 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,088 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:44,089 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:44,089 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:44,089 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:44,089 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:44,089 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:44,090 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 9]: Loop Invariant 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 15]: Loop Invariant 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:44,090 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 11]: Loop Invariant 2019-05-11 07:10:44,091 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:44,091 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:44,091 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:44,091 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:44,091 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:44,091 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function y + 0 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. 2019-05-11 07:10:44,091 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:44,092 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 > 0);" "assume true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "assume true;assume !(~x~2 > 0);" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 > 0 && ~y~2 > 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" }, returnAlphabet = {"return;" "return;" }, states = {"161#unseeded" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "171#(<= main_~y~2 oldRank0)" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" }, initialStates = {"161#unseeded" }, finalStates = {"170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("161#unseeded" "call #t~ret2 := main();" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("161#unseeded" "call ULTIMATE.init();" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("164#(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 (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 > 0);" "171#(<= main_~y~2 oldRank0)") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("171#(<= main_~y~2 oldRank0)" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("171#(<= main_~y~2 oldRank0)" "assume true;" "171#(<= main_~y~2 oldRank0)") ("171#(<= main_~y~2 oldRank0)" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !(~x~2 > 0);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") }, returnTransitions = { ("164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "161#unseeded" "return;" "161#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 > 0);" "assume true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "assume true;assume !(~x~2 > 0);" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 > 0 && ~y~2 > 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" }, returnAlphabet = {"return;" "return;" }, states = {"161#unseeded" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "171#(<= main_~y~2 oldRank0)" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" }, initialStates = {"161#unseeded" }, finalStates = {"170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("161#unseeded" "call #t~ret2 := main();" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("161#unseeded" "call ULTIMATE.init();" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("164#(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 (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 > 0);" "171#(<= main_~y~2 oldRank0)") ("170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("171#(<= main_~y~2 oldRank0)" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("171#(<= main_~y~2 oldRank0)" "assume true;" "171#(<= main_~y~2 oldRank0)") ("171#(<= main_~y~2 oldRank0)" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !(~x~2 > 0);" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "170#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") ("174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "174#(and (<= main_~y~2 oldRank0) (<= 1 oldRank0))") }, returnTransitions = { ("164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "161#unseeded" "return;" "161#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 > 0);" "assume true;" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "assume true;assume !(~x~2 > 0);" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 > 0 && ~y~2 > 0);" "assume true;" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" }, returnAlphabet = {"return;" "return;" }, states = {"304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "312#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "301#unseeded" }, initialStates = {"301#unseeded" }, finalStates = {"312#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("301#unseeded" "call #t~ret2 := main();" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#unseeded" "call ULTIMATE.init();" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume !(~x~2 > ~y~2);" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~y~2 := ~y~2 - 1;" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 > 0);" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0 && ~y~2 > 0);assume ~x~2 > ~y~2;" "312#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("304#(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;" "304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("312#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0);~x~2 := ~x~2 - 1;" "312#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("304#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "301#unseeded" "return;" "301#unseeded") } ); 2019-05-11 07:10:44,093 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:44,093 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 0.9s and 7 iterations. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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 18 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 1/1 InterpolantCoveringCapabilityBuchi: 1/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 54 SDtfs, 9 SDslu, 15 SDs, 0 lazy, 74 Sat,56 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.0s LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital14 mio100 ax100 hnf94 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp88 dnf100 smp100 tf112 neg100 sie100 Nontermination: inital14 mio100 ax100 hnf94 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp88 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:10:44,094 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:44,094 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:44,094 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:44,094 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:44,100 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.12 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.61 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.65 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 226.58 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 581.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 53.1 GB * BlockEncoding took 66.95 ms. Allocated memory is still 643.3 MB. Free memory was 581.2 MB in the beginning and 575.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * TraceAbstraction took 95.54 ms. Allocated memory is still 643.3 MB. Free memory was 575.8 MB in the beginning and 569.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 936.93 ms. Allocated memory is still 643.3 MB. Free memory was 569.2 MB in the beginning and 471.5 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 53.1 GB 2019-05-11 07:10:44,127 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully