YES 2019-05-11 07:11:10,184 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:10,187 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,191 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,191 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:10,192 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:10,192 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:10,193 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:10,193 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:10,193 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:10,196 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:10,196 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:10,196 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:10,196 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:10,197 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:10,197 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,198 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:12,276 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:12,276 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:12,276 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:12,277 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:12,634 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:12,634 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:12,635 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:12,635 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:12,635 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:12,635 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:12,635 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:12,636 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:12,636 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:12,636 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:12,636 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:12,636 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:12,637 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:12,637 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:12,637 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:12,637 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:12,637 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:12,637 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:12,638 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:12,638 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:12,638 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:12,638 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:12,638 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:12,639 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:12,639 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:12,639 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:12,639 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:12,639 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:12,639 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:12,640 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:12,640 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:12,640 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:12,640 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:12,640 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:12,641 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:12,859 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:12,865 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:12,866 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:12,868 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:12,869 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:12,870 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:12,870 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:12,991 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:12,992 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:12,993 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:12,993 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:12,996 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:12,997 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:12" (1/1) ... 2019-05-11 07:11:13,105 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:13,105 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,106 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:13,106 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:13,122 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:11:13" (1/1) ... 2019-05-11 07:11:13,126 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:11:13" (1/1) ... 2019-05-11 07:11:13,126 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:11:13" (1/1) ... 2019-05-11 07:11:13,128 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:11:13" (1/1) ... 2019-05-11 07:11:13,130 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:11:13" (1/1) ... 2019-05-11 07:11:13,130 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:11:13" (1/1) ... 2019-05-11 07:11:13,131 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,132 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:13,132 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:13,132 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:13,133 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,233 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:11:13,235 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:11:13,348 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:13,348 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:13,349 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:13,350 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:13,350 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,364 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,404 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,405 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,406 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,407 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,409 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:13,410 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:13,410 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:13,411 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:13,411 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:13" (1/5) ... 2019-05-11 07:11:13,412 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (2/5) ... 2019-05-11 07:11:13,413 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:13" (3/5) ... 2019-05-11 07:11:13,413 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (4/5) ... 2019-05-11 07:11:13,414 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:12" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:13,509 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:13,509 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:13,509 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:13,510 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:13,512 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:14,882 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:14,883 INFO [Benchmark.java:150]: Toolchain (without parser) took 1891.94 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 414.5 MB in the end (delta: 195.7 MB). Peak memory consumption was 195.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,898 INFO [Benchmark.java:150]: CDTParser took 109.83 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,899 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.48 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,899 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,900 INFO [Benchmark.java:150]: RCFGBuilder took 216.41 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.1 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,901 INFO [Benchmark.java:150]: BlockEncoding took 61.26 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,902 INFO [Benchmark.java:150]: TraceAbstraction took 99.32 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 579.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,903 INFO [Benchmark.java:150]: BuchiAutomizer took 1373.06 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 414.5 MB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,909 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:11:14,910 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:14,910 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:14,910 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:14,910 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 13]: Loop Invariant 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:14,911 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 10]: Loop Invariant 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:95]: CFG has 12 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 12 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:11:14,912 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:11:14,912 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:14,913 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 2;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))" "381#unseeded" }, initialStates = {"381#unseeded" }, finalStates = {"391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("381#unseeded" "call #t~ret2 := main();" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("381#unseeded" "call ULTIMATE.init();" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~x~2 > ~y~2);" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 2;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("392#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 2;" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "381#unseeded" "return;" "381#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 2;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "87#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))" "78#unseeded" }, initialStates = {"78#unseeded" }, finalStates = {"87#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("78#unseeded" "call #t~ret2 := main();" "81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("78#unseeded" "call ULTIMATE.init();" "81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "87#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("87#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))") ("91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))") ("91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))") ("91#(exists ((v_main_~x~2_30 Int)) (and (<= 0 v_main_~x~2_30) (<= main_~x~2 (+ v_main_~x~2_30 1)) (<= (+ (* 2 v_main_~x~2_30) 1) oldRank0)))" "~x~2 := ~x~2 - 2;" "87#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") }, returnTransitions = { ("81#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "78#unseeded" "return;" "78#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 2;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"144#unseeded" "147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "155#(<= main_~x~2 (+ main_~y~2 oldRank0))" }, initialStates = {"144#unseeded" }, finalStates = {"154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("144#unseeded" "call #t~ret2 := main();" "147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("144#unseeded" "call ULTIMATE.init();" "147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("154#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "155#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("155#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 2;" "155#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("147#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "144#unseeded" "return;" "144#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 2;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))" "381#unseeded" }, initialStates = {"381#unseeded" }, finalStates = {"391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("381#unseeded" "call #t~ret2 := main();" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("381#unseeded" "call ULTIMATE.init();" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~x~2 > ~y~2);" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 2;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~x~2 := ~x~2 + 1;~y~2 := 1;" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := ~y~2 + 1;~c~2 := ~c~2 + 1;" "391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("391#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("392#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 2;" "392#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("384#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "381#unseeded" "return;" "381#unseeded") } ); 2019-05-11 07:11:14,913 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:14,914 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.3s and 5 iterations. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization removed 6 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 1/1 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 11 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 66 Sat,72 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.0s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital16 mio100 ax100 hnf108 lsp80 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf110 neg100 sie100 Nontermination: inital16 mio100 ax100 hnf108 lsp80 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 31ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:14,914 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:14,914 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:14,915 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:14,915 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:14,921 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 109.83 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.48 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 26.14 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 216.41 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.1 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 53.1 GB * BlockEncoding took 61.26 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 99.32 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 579.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1373.06 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 414.5 MB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:14,948 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully