YES 2019-05-11 07:10:08,738 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:08,741 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,744 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,745 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:08,745 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:08,746 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:08,746 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:08,746 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:08,747 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:08,749 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:08,749 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:08,750 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:08,750 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:08,750 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:08,750 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:08,752 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:10,244 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:10,245 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:10,245 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:10,245 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:10,596 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:10,596 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:10,597 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:10,597 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:10,597 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:10,597 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:10,598 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:10,598 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:10,598 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:10,598 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:10,598 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:10,599 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:10,599 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:10,599 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:10,599 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:10,599 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:10,600 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:10,600 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:10,600 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:10,600 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:10,600 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:10,600 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:10,601 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:10,601 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:10,601 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:10,601 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:10,601 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:10,601 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:10,602 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:10,602 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:10,602 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:10,602 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:10,602 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:10,603 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:10,603 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:10,834 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:10,841 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:10,841 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:10,844 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:10,845 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:10,846 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:10,846 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:10,973 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:10,975 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:10,975 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:10,976 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:10,979 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:10,980 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:10" (1/1) ... 2019-05-11 07:10:11,089 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:11,089 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:11,089 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:11,090 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:11,106 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,111 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,111 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,113 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,114 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,115 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,116 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:11,116 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:11,117 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:11,117 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:11,118 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,214 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:10:11,216 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:11,321 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:11,322 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:11,322 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:11,323 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:11,323 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,336 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:11,352 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,353 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:11,380 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:11,380 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:11,380 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:11,381 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:11,382 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:10:11" (1/5) ... 2019-05-11 07:10:11,382 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:10" (2/5) ... 2019-05-11 07:10:11,383 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:11" (3/5) ... 2019-05-11 07:10:11,383 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:11" (4/5) ... 2019-05-11 07:10:11,384 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:11" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:11,474 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:11,474 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:11,475 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:11,475 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:11,477 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:10:11" (1/1) ... 2019-05-11 07:10:12,444 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:12,445 INFO [Benchmark.java:150]: Toolchain (without parser) took 1471.72 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 474.8 MB in the end (delta: 135.4 MB). Peak memory consumption was 135.4 MB. Max. memory is 53.1 GB 2019-05-11 07:10:12,459 INFO [Benchmark.java:150]: CDTParser took 115.66 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:10:12,461 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 113.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:10:12,462 INFO [Benchmark.java:150]: Boogie Preprocessor took 27.03 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 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:10:12,463 INFO [Benchmark.java:150]: RCFGBuilder took 205.18 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB 2019-05-11 07:10:12,463 INFO [Benchmark.java:150]: BlockEncoding took 58.09 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.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:10:12,464 INFO [Benchmark.java:150]: TraceAbstraction took 94.08 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.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:10:12,465 INFO [Benchmark.java:150]: BuchiAutomizer took 970.00 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 474.8 MB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 53.1 GB 2019-05-11 07:10:12,473 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:10:12,473 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:12,473 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:12,474 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:12,474 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:12,474 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:10:12,474 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:10:12,474 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:12,475 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:12,476 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function q + 0 and consists of 6 locations. One deterministic module has affine ranking function p + 0 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. 2019-05-11 07:10:12,476 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:12,476 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" }, returnAlphabet = {"return;" "return;" }, states = {"53#unseeded" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "63#(<= main_~q~2 oldRank0)" }, initialStates = {"53#unseeded" }, finalStates = {"27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("53#unseeded" "call #t~ret2 := main();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("53#unseeded" "call ULTIMATE.init();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~p~2 < ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !true;" "27#false") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "#res := 0;assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume !true;" "27#false") ("63#(<= main_~q~2 oldRank0)" "assume true;" "63#(<= main_~q~2 oldRank0)") ("63#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("63#(<= main_~q~2 oldRank0)" "assume !true;" "27#false") ("63#(<= main_~q~2 oldRank0)" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "63#(<= main_~q~2 oldRank0)") ("63#(<= main_~q~2 oldRank0)" "#res := 0;assume true;" "63#(<= main_~q~2 oldRank0)") }, returnTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "53#unseeded" "return;" "53#unseeded") ("27#false" "53#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" }, returnAlphabet = {"return;" "return;" }, states = {"53#unseeded" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "63#(<= main_~q~2 oldRank0)" }, initialStates = {"53#unseeded" }, finalStates = {"27#false" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" }, callTransitions = { ("53#unseeded" "call #t~ret2 := main();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("53#unseeded" "call ULTIMATE.init();" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~q~2 < ~p~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !(~p~2 < ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !true;" "27#false") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))" "#res := 0;assume true;" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume true;" "63#(<= main_~q~2 oldRank0)") ("62#(and (<= 0 oldRank0) (<= (+ main_~q~2 1) oldRank0))" "assume !true;" "27#false") ("63#(<= main_~q~2 oldRank0)" "assume true;" "63#(<= main_~q~2 oldRank0)") ("63#(<= main_~q~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "72#(and (<= main_~q~2 oldRank0) (<= 1 main_~q~2))") ("63#(<= main_~q~2 oldRank0)" "assume !true;" "27#false") ("63#(<= main_~q~2 oldRank0)" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "63#(<= main_~q~2 oldRank0)") ("63#(<= main_~q~2 oldRank0)" "#res := 0;assume true;" "63#(<= main_~q~2 oldRank0)") }, returnTransitions = { ("56#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "53#unseeded" "return;" "53#unseeded") ("27#false" "53#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume true;" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "assume !(~q~2 < ~p~2);" "assume !(~p~2 < ~q~2);" "assume true;" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "assume !((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" }, returnAlphabet = {"return;" "return;" }, states = {"241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "226#unseeded" "229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "237#(<= main_~p~2 oldRank0)" }, initialStates = {"226#unseeded" }, finalStates = {"236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" }, callTransitions = { ("226#unseeded" "call #t~ret2 := main();" "229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("226#unseeded" "call ULTIMATE.init();" "229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume true;" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume !(~q~2 < ~p~2);" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume true;" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume ~p~2 < ~q~2;~p~2 := ~p~2 - 1;" "236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))") ("241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))" "assume ~q~2 < ~p~2;~q~2 := ~q~2 - 1;" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))") ("229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~p~2;havoc ~q~2;~q~2 := #t~nondet0;havoc #t~nondet0;~p~2 := #t~nondet1;havoc #t~nondet1;" "229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") ("236#(and (<= 0 oldRank0) (<= (+ main_~p~2 1) oldRank0))" "assume true;" "237#(<= main_~p~2 oldRank0)") ("237#(<= main_~p~2 oldRank0)" "assume true;" "237#(<= main_~p~2 oldRank0)") ("237#(<= main_~p~2 oldRank0)" "assume !!((~q~2 > 0 && ~p~2 > 0) && ~p~2 != ~q~2);" "241#(and (<= 1 main_~p~2) (<= main_~p~2 oldRank0))") }, returnTransitions = { ("229#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "226#unseeded" "return;" "226#unseeded") } ); 2019-05-11 07:10:12,477 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:12,478 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 0.9s and 4 iterations. Analysis of lassos took 0.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization removed 10 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 10 SDtfs, 9 SDslu, 10 SDs, 0 lazy, 100 Sat,64 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital15 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf103 smp84 dnf100 smp100 tf110 neg100 sie100 Nontermination: inital15 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf103 smp84 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:10:12,479 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:12,479 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:12,479 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:12,479 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:12,486 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 115.66 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 113.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 27.03 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 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 205.18 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB * BlockEncoding took 58.09 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 584.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 94.08 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 970.00 ms. Allocated memory is still 649.6 MB. Free memory was 577.6 MB in the beginning and 474.8 MB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 53.1 GB 2019-05-11 07:10:12,514 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully