YES 2019-05-11 07:09:39,927 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:39,930 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,934 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,934 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:39,935 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:39,936 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:39,936 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:39,936 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:39,937 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:39,939 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:39,939 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:39,940 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:39,940 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:39,940 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:39,940 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,941 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:41,543 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:41,543 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:41,543 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:41,543 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:41,891 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:41,892 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:41,892 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:41,892 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:41,892 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:41,893 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:41,894 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:41,894 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:41,895 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:41,896 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:41,897 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:41,897 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:41,898 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:41,898 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:41,898 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:42,114 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:42,121 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:42,121 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:42,123 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:42,125 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:42,125 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:42,125 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:42,250 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:42,252 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:42,252 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:42,252 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:42,255 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:42,256 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:42" (1/1) ... 2019-05-11 07:09:42,364 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:42,365 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:42,365 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:42,365 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:42,381 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:42" (1/1) ... 2019-05-11 07:09:42,385 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:42" (1/1) ... 2019-05-11 07:09:42,386 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:42" (1/1) ... 2019-05-11 07:09:42,387 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:42" (1/1) ... 2019-05-11 07:09:42,389 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:42" (1/1) ... 2019-05-11 07:09:42,389 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:42" (1/1) ... 2019-05-11 07:09:42,390 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:42,391 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:42,391 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:42,391 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:42,392 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:42" (1/1) ... 2019-05-11 07:09:42,488 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:42,490 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:42,599 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:42,599 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:42,599 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:42,600 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:42,601 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:42" (1/1) ... 2019-05-11 07:09:42,615 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:42" (1/1) ... 2019-05-11 07:09:42,632 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:42,633 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:42,652 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:42,653 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:42,653 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:42,654 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:42,654 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:42" (1/5) ... 2019-05-11 07:09:42,655 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:42" (2/5) ... 2019-05-11 07:09:42,655 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:42" (3/5) ... 2019-05-11 07:09:42,656 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:42" (4/5) ... 2019-05-11 07:09:42,656 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:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:42,756 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:42,758 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:42,758 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:42,759 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:42,761 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:42" (1/1) ... 2019-05-11 07:09:44,106 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:44,107 INFO [Benchmark.java:150]: Toolchain (without parser) took 1856.33 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 414.3 MB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,109 INFO [Benchmark.java:150]: CDTParser took 113.49 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,110 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.59 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,111 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.79 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,111 INFO [Benchmark.java:150]: RCFGBuilder took 208.05 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 465.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,112 INFO [Benchmark.java:150]: BlockEncoding took 53.42 ms. Allocated memory is still 514.9 MB. Free memory was 465.9 MB in the beginning and 462.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,113 INFO [Benchmark.java:150]: TraceAbstraction took 105.16 ms. Allocated memory is still 514.9 MB. Free memory was 462.5 MB in the beginning and 455.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,114 INFO [Benchmark.java:150]: BuchiAutomizer took 1348.09 ms. Allocated memory is still 514.9 MB. Free memory was 455.7 MB in the beginning and 414.3 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,120 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:09:44,121 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:44,121 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:44,121 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:44,121 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:44,121 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:44,121 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:09:44,122 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:44,122 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:09:44,122 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:44,122 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:44,122 INFO [BasicToolchainJob.java:95]: CFG has 13 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 13 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:09:44,123 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:44,123 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:44,123 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function q + 0 and consists of 6 locations. One deterministic module has affine ranking function q + 0 and consists of 5 locations. One nondeterministic module has affine ranking function q + 0 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 2019-05-11 07:09:44,123 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:44,123 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration3 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "assume true;" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~q~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~q~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"576#(<= main_~q~2 oldRank0)" "577#(and unseeded (<= main_~y~2 0))" "562#unseeded" "596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "510#false" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, initialStates = {"562#unseeded" }, finalStates = {"510#false" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("562#unseeded" "call #t~ret3 := main();" "562#unseeded") ("562#unseeded" "call ULTIMATE.init();" "562#unseeded") }, internalTransitions = { ("576#(<= main_~q~2 oldRank0)" "assume true;" "576#(<= main_~q~2 oldRank0)") ("576#(<= main_~q~2 oldRank0)" "assume !!(~q~2 > 0);" "596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("577#(and unseeded (<= main_~y~2 0))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume true;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "510#false") ("577#(and unseeded (<= main_~y~2 0))" "assume true;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume !!(~q~2 > 0);" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("562#unseeded" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "562#unseeded") ("562#unseeded" "assume true;" "562#unseeded") ("562#unseeded" "assume true;" "562#unseeded") ("562#unseeded" "assume !!(~q~2 > 0);" "562#unseeded") ("596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("510#false" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "510#false") ("510#false" "assume true;" "510#false") ("510#false" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "510#false") ("510#false" "assume true;" "510#false") ("510#false" "assume !!(~q~2 > 0);" "510#false") ("575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "576#(<= main_~q~2 oldRank0)") }, returnTransitions = { ("562#unseeded" "562#unseeded" "return;" "562#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "assume true;" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~q~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~q~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "73#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "26#false" "61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "62#(<= main_~q~2 oldRank0)" }, initialStates = {"52#unseeded" }, finalStates = {"26#false" "61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("52#unseeded" "call #t~ret3 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("73#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "62#(<= main_~q~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume !true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "62#(<= main_~q~2 oldRank0)") ("62#(<= main_~q~2 oldRank0)" "assume !(~q~2 > 0);" "62#(<= main_~q~2 oldRank0)") ("62#(<= main_~q~2 oldRank0)" "assume !true;" "26#false") ("62#(<= main_~q~2 oldRank0)" "#res := 0;assume true;" "62#(<= main_~q~2 oldRank0)") ("62#(<= main_~q~2 oldRank0)" "assume true;" "62#(<= main_~q~2 oldRank0)") ("62#(<= main_~q~2 oldRank0)" "assume !!(~q~2 > 0);" "73#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("26#false" "52#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "assume true;" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~q~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~q~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"192#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "179#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "180#(<= main_~q~2 oldRank0)" "165#unseeded" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"165#unseeded" }, finalStates = {"179#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("165#unseeded" "call #t~ret3 := main();" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("165#unseeded" "call ULTIMATE.init();" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("192#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "179#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("179#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "180#(<= main_~q~2 oldRank0)") ("180#(<= main_~q~2 oldRank0)" "assume true;" "180#(<= main_~q~2 oldRank0)") ("180#(<= main_~q~2 oldRank0)" "assume !!(~q~2 > 0);" "192#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "179#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~q~2 > 0);" "168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("168#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "165#unseeded" "return;" "165#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "assume true;" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~q~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~q~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"576#(<= main_~q~2 oldRank0)" "577#(and unseeded (<= main_~y~2 0))" "562#unseeded" "596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "510#false" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, initialStates = {"562#unseeded" }, finalStates = {"510#false" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("562#unseeded" "call #t~ret3 := main();" "562#unseeded") ("562#unseeded" "call ULTIMATE.init();" "562#unseeded") }, internalTransitions = { ("576#(<= main_~q~2 oldRank0)" "assume true;" "576#(<= main_~q~2 oldRank0)") ("576#(<= main_~q~2 oldRank0)" "assume !!(~q~2 > 0);" "596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("577#(and unseeded (<= main_~y~2 0))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume true;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "510#false") ("577#(and unseeded (<= main_~y~2 0))" "assume true;" "577#(and unseeded (<= main_~y~2 0))") ("577#(and unseeded (<= main_~y~2 0))" "assume !!(~q~2 > 0);" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "577#(and unseeded (<= main_~y~2 0))") ("562#unseeded" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("562#unseeded" "havoc ~q~2;havoc ~y~2;~q~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "562#unseeded") ("562#unseeded" "assume true;" "562#unseeded") ("562#unseeded" "assume true;" "562#unseeded") ("562#unseeded" "assume !!(~q~2 > 0);" "562#unseeded") ("596#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("510#false" "assume !(~y~2 > 0);~y~2 := ~y~2 - 1;~q~2 := ~q~2 - 1;" "510#false") ("510#false" "assume true;" "510#false") ("510#false" "assume ~y~2 > 0;~y~2 := 0;~q~2 := #t~nondet2;havoc #t~nondet2;" "510#false") ("510#false" "assume true;" "510#false") ("510#false" "assume !!(~q~2 > 0);" "510#false") ("575#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "576#(<= main_~q~2 oldRank0)") }, returnTransitions = { ("562#unseeded" "562#unseeded" "return;" "562#unseeded") } ); 2019-05-11 07:09:44,124 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:44,125 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.3s and 4 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization removed 3 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 3/3 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 144 Sat,147 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital19 mio100 ax100 hnf94 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 Nontermination: inital19 mio100 ax100 hnf94 lsp55 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:09:44,125 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:44,125 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:44,125 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:44,125 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:44,132 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 113.49 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.59 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.79 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 208.05 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 465.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 53.1 GB * BlockEncoding took 53.42 ms. Allocated memory is still 514.9 MB. Free memory was 465.9 MB in the beginning and 462.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 53.1 GB * TraceAbstraction took 105.16 ms. Allocated memory is still 514.9 MB. Free memory was 462.5 MB in the beginning and 455.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1348.09 ms. Allocated memory is still 514.9 MB. Free memory was 455.7 MB in the beginning and 414.3 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,157 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully