YES 2019-05-11 07:09:39,661 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:39,664 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,668 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,668 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:39,669 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:39,669 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:39,670 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:39,670 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:39,670 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:39,673 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:39,673 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:39,673 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:39,674 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:39,674 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:39,674 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:39,675 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:41,544 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:41,544 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:41,545 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:41,545 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:41,892 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:41,893 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:41,893 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:41,893 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:41,894 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:41,894 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:41,895 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:41,895 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:41,895 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:41,896 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:41,896 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:41,897 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:41,897 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:41,898 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,898 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:41,898 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:41,899 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:41,899 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:42,112 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:42,118 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:42,119 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:42,121 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:42,122 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:42,122 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:42,123 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:42,244 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:42,246 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:42,246 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:42,246 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:42,250 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:42,250 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,358 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:42,358 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:42,359 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:42,359 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:42,374 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,379 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,379 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,381 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,382 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,383 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,384 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:42,384 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:42,385 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:42,385 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:42,386 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,480 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,482 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,585 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:42,585 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:42,586 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:42,587 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:42,587 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,601 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,615 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:42,616 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:42,636 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:42,637 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:42,637 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:42,638 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:42,638 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" (1/5) ... 2019-05-11 07:09:42,639 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:42" (2/5) ... 2019-05-11 07:09:42,640 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,640 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:42" (4/5) ... 2019-05-11 07:09:42,641 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" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:42,731 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:42,732 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:42,732 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:42,732 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:42,734 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:09:42" (1/1) ... 2019-05-11 07:09:44,462 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:44,464 INFO [Benchmark.java:150]: Toolchain (without parser) took 2219.05 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 595.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,466 INFO [Benchmark.java:150]: CDTParser took 110.64 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,467 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.99 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,468 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 649.6 MB. Free memory was 606.3 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,469 INFO [Benchmark.java:150]: RCFGBuilder took 200.71 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,470 INFO [Benchmark.java:150]: BlockEncoding took 51.14 ms. Allocated memory is still 649.6 MB. Free memory was 589.2 MB in the beginning and 586.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:44,470 INFO [Benchmark.java:150]: TraceAbstraction took 94.62 ms. Allocated memory is still 649.6 MB. Free memory was 586.5 MB in the beginning and 579.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,471 INFO [Benchmark.java:150]: BuchiAutomizer took 1731.34 ms. Allocated memory is still 649.6 MB. Free memory was 579.7 MB in the beginning and 595.7 MB in the end (delta: -16.0 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:44,478 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,479 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:44,479 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:44,479 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:44,479 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:44,479 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,480 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 14]: Procedure Contract for main 2019-05-11 07:09:44,480 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:44,480 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:09:44,480 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:44,480 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:44,480 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,481 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:44,481 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:44,481 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 y + 0 and consists of 6 locations. One deterministic module has affine ranking function x + 0 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 5 locations. One nondeterministic module has affine ranking function x + 0 and consists of 5 locations. 2019-05-11 07:09:44,481 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:44,481 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "assume true;" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~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 && ~y~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 > 0 && ~y~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_~y~2 oldRank0) (<= 1 main_~y~2))" "26#false" "61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "62#(<= main_~y~2 oldRank0)" }, initialStates = {"52#unseeded" }, finalStates = {"26#false" "61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("52#unseeded" "call #t~ret4 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "61#(and (<= 0 oldRank0) (<= (+ main_~y~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_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !(~x~2 > 0 && ~y~2 > 0);" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !true;" "26#false") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "#res := 0;assume true;" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume !!(~x~2 > 0 && ~y~2 > 0);" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "62#(<= main_~y~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume !true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "62#(<= main_~y~2 oldRank0)") ("62#(<= main_~y~2 oldRank0)" "assume !(~x~2 > 0 && ~y~2 > 0);" "62#(<= main_~y~2 oldRank0)") ("62#(<= main_~y~2 oldRank0)" "assume !true;" "26#false") ("62#(<= main_~y~2 oldRank0)" "#res := 0;assume true;" "62#(<= main_~y~2 oldRank0)") ("62#(<= main_~y~2 oldRank0)" "assume true;" "62#(<= main_~y~2 oldRank0)") ("62#(<= main_~y~2 oldRank0)" "assume !!(~x~2 > 0 && ~y~2 > 0);" "73#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~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~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "assume true;" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~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 && ~y~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 > 0 && ~y~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"176#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "161#unseeded" "164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "172#(<= main_~x~2 oldRank0)" }, initialStates = {"161#unseeded" }, finalStates = {"171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("161#unseeded" "call #t~ret4 := 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 = { ("176#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("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;" "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)|))))" "assume true;" "171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("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)|))))") ("171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "172#(<= main_~x~2 oldRank0)") ("171#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !!(~x~2 > 0 && ~y~2 > 0);" "176#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("172#(<= main_~x~2 oldRank0)" "assume true;" "172#(<= main_~x~2 oldRank0)") ("172#(<= main_~x~2 oldRank0)" "assume !!(~x~2 > 0 && ~y~2 > 0);" "176#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") }, returnTransitions = { ("164#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "161#unseeded" "return;" "161#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "assume true;" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~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 && ~y~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 > 0 && ~y~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "286#unseeded" "302#(<= main_~x~2 oldRank0)" "318#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" }, initialStates = {"286#unseeded" }, finalStates = {"301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("286#unseeded" "call #t~ret4 := main();" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("286#unseeded" "call ULTIMATE.init();" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("289#(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;" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 > 0 && ~y~2 > 0);" "289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "302#(<= main_~x~2 oldRank0)") ("301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "302#(<= main_~x~2 oldRank0)") ("302#(<= main_~x~2 oldRank0)" "assume true;" "302#(<= main_~x~2 oldRank0)") ("302#(<= main_~x~2 oldRank0)" "assume !!(~x~2 > 0 && ~y~2 > 0);" "318#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("318#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "301#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("289#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "286#unseeded" "return;" "286#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "assume true;" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~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 && ~y~2 > 0);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 > 0 && ~y~2 > 0);" }, returnAlphabet = {"return;" "return;" }, states = {"690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "675#unseeded" "691#(<= main_~x~2 oldRank0)" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "701#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" }, initialStates = {"675#unseeded" }, finalStates = {"690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("675#unseeded" "call #t~ret4 := main();" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("675#unseeded" "call ULTIMATE.init();" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "691#(<= main_~x~2 oldRank0)") ("690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "691#(<= main_~x~2 oldRank0)") ("691#(<= main_~x~2 oldRank0)" "assume true;" "691#(<= main_~x~2 oldRank0)") ("691#(<= main_~x~2 oldRank0)" "assume !!(~x~2 > 0 && ~y~2 > 0);" "701#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet2 != 0);havoc #t~nondet2;~x~2 := #t~nondet3;havoc #t~nondet3;~y~2 := ~y~2 - 1;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(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;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 > 0 && ~y~2 > 0);" "678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("701#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume #t~nondet2 != 0;havoc #t~nondet2;~x~2 := ~x~2 - 1;" "690#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("678#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "675#unseeded" "return;" "675#unseeded") } ); 2019-05-11 07:09:44,482 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:44,483 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.7s and 5 iterations. Analysis of lassos took 0.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization removed 20 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 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, 184 Sat,144 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital17 mio100 ax100 hnf95 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 Nontermination: inital17 mio100 ax100 hnf95 lsp60 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:09:44,483 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:44,483 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:44,483 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:44,483 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:44,490 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.64 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.99 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.3 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.92 ms. Allocated memory is still 649.6 MB. Free memory was 606.3 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 200.71 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB * BlockEncoding took 51.14 ms. Allocated memory is still 649.6 MB. Free memory was 589.2 MB in the beginning and 586.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 53.1 GB * TraceAbstraction took 94.62 ms. Allocated memory is still 649.6 MB. Free memory was 586.5 MB in the beginning and 579.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1731.34 ms. Allocated memory is still 649.6 MB. Free memory was 579.7 MB in the beginning and 595.7 MB in the end (delta: -16.0 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:44,515 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully