./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65401fe061f89bb729dffabf74050dfab9fe7d77 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:18:42,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:18:42,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:18:42,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:18:42,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:18:42,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:18:42,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:18:42,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:18:42,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:18:42,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:18:42,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:18:42,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:18:42,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:18:42,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:18:42,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:18:42,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:18:42,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:18:42,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:18:42,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:18:42,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:18:42,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:18:42,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:18:42,883 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:18:42,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:18:42,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:18:42,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:18:42,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:18:42,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:18:42,887 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:18:42,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:18:42,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:18:42,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:18:42,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:18:42,890 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:18:42,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:18:42,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:18:42,891 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:18:42,903 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:18:42,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:18:42,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:18:42,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:18:42,905 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:18:42,905 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:18:42,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:18:42,906 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:18:42,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:18:42,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:18:42,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:18:42,909 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:18:42,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:18:42,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:18:42,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:18:42,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:18:42,910 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:18:42,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:18:42,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:18:42,911 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:18:42,911 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:18:42,912 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2018-11-18 13:18:42,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:18:42,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:18:42,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:18:42,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:18:42,949 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:18:42,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:18:42,987 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/data/05f55d094/e8f5edf2145240c286ed814642e72b9c/FLAGd676cc4f0 [2018-11-18 13:18:43,446 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:18:43,447 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:18:43,456 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/data/05f55d094/e8f5edf2145240c286ed814642e72b9c/FLAGd676cc4f0 [2018-11-18 13:18:43,468 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/data/05f55d094/e8f5edf2145240c286ed814642e72b9c [2018-11-18 13:18:43,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:18:43,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:18:43,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:43,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:18:43,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:18:43,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52211fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43, skipping insertion in model container [2018-11-18 13:18:43,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:18:43,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:18:43,727 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:43,734 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:18:43,764 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:43,840 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:18:43,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43 WrapperNode [2018-11-18 13:18:43,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:43,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:43,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:18:43,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:18:43,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:43,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:18:43,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:18:43,868 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:18:43,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... [2018-11-18 13:18:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:18:43,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:18:43,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:18:43,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:18:43,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:18:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:18:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:18:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:18:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:18:43,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:18:44,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:18:44,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:44 BoogieIcfgContainer [2018-11-18 13:18:44,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:18:44,060 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:18:44,060 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:18:44,063 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:18:44,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:44,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:18:43" (1/3) ... [2018-11-18 13:18:44,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69980291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:18:44, skipping insertion in model container [2018-11-18 13:18:44,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:44,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:43" (2/3) ... [2018-11-18 13:18:44,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69980291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:18:44, skipping insertion in model container [2018-11-18 13:18:44,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:44,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:44" (3/3) ... [2018-11-18 13:18:44,066 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:18:44,101 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:18:44,102 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:18:44,102 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:18:44,102 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:18:44,102 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:18:44,102 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:18:44,102 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:18:44,102 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:18:44,102 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:18:44,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 13:18:44,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:18:44,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:44,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:44,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:18:44,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:44,133 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:18:44,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 13:18:44,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:18:44,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:44,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:44,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:18:44,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:44,140 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 10#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L551-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 15#L543-4true [2018-11-18 13:18:44,141 INFO L796 eck$LassoCheckResult]: Loop: 15#L543-4true assume true; 7#L543-1true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 12#L544-4true assume !true; 13#L543-3true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 15#L543-4true [2018-11-18 13:18:44,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 13:18:44,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1329256, now seen corresponding path program 1 times [2018-11-18 13:18:44,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:44,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:44,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:18:44,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:18:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:18:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:18:44,260 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 13:18:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:44,264 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-18 13:18:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:18:44,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-18 13:18:44,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:18:44,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-18 13:18:44,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 13:18:44,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 13:18:44,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 13:18:44,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:18:44,271 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:18:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 13:18:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 13:18:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 13:18:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 13:18:44,293 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:18:44,294 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:18:44,294 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:18:44,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 13:18:44,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:18:44,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:44,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:44,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:18:44,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:18:44,295 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 44#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 46#L543-4 [2018-11-18 13:18:44,295 INFO L796 eck$LassoCheckResult]: Loop: 46#L543-4 assume true; 40#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 41#L544-4 assume true; 47#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 45#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 46#L543-4 [2018-11-18 13:18:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 13:18:44,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash 41193117, now seen corresponding path program 1 times [2018-11-18 13:18:44,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:44,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:44,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:18:44,333 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:18:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:18:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:44,333 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 13:18:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:44,377 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-18 13:18:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:18:44,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-18 13:18:44,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 13:18:44,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2018-11-18 13:18:44,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 13:18:44,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 13:18:44,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-18 13:18:44,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:18:44,380 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 13:18:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-18 13:18:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 13:18:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 13:18:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-18 13:18:44,381 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 13:18:44,381 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 13:18:44,381 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:18:44,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-18 13:18:44,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 13:18:44,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:44,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:44,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:18:44,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:44,383 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 69#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 75#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 78#L543-4 [2018-11-18 13:18:44,383 INFO L796 eck$LassoCheckResult]: Loop: 78#L543-4 assume true; 70#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 71#L544-4 assume true; 76#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 79#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 73#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 74#L544-4 assume true; 80#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 77#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 78#L543-4 [2018-11-18 13:18:44,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-18 13:18:44,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2058950986, now seen corresponding path program 1 times [2018-11-18 13:18:44,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:44,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash 722757458, now seen corresponding path program 1 times [2018-11-18 13:18:44,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:44,566 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-18 13:18:44,704 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:18:44,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:18:44,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:18:44,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:18:44,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:18:44,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:44,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:18:44,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:18:44,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 13:18:44,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:18:44,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:18:44,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:44,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,115 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:18:45,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:18:45,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,224 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:18:45,248 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 13:18:45,249 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 13:18:45,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:18:45,252 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:18:45,252 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:18:45,253 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-18 13:18:45,277 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 13:18:45,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:45,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:45,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:18:45,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:18:45,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 13:18:45,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 6 states. [2018-11-18 13:18:45,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:18:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 13:18:45,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-18 13:18:45,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:45,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-18 13:18:45,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:45,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-18 13:18:45,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:45,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2018-11-18 13:18:45,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:45,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2018-11-18 13:18:45,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 13:18:45,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 13:18:45,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-18 13:18:45,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:18:45,372 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 13:18:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-18 13:18:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-18 13:18:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 13:18:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-18 13:18:45,373 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 13:18:45,373 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 13:18:45,373 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:18:45,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-18 13:18:45,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:45,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:45,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:45,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:18:45,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:45,375 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 182#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 191#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 198#L543-4 assume true; 183#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 184#L544-4 [2018-11-18 13:18:45,375 INFO L796 eck$LassoCheckResult]: Loop: 184#L544-4 assume true; 192#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 196#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 188#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 184#L544-4 [2018-11-18 13:18:45,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 13:18:45,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:45,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:45,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:45,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 1 times [2018-11-18 13:18:45,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:45,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:45,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2015039279, now seen corresponding path program 1 times [2018-11-18 13:18:45,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:45,557 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:18:45,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:18:45,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:18:45,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:18:45,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:18:45,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:45,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:18:45,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:18:45,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 13:18:45,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:18:45,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:18:45,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:45,846 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:18:45,846 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:18:45,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:45,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:45,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:45,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,872 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:18:45,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,874 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:18:45,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:45,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:45,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:45,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:45,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:45,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:45,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:45,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:45,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:18:45,932 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 13:18:45,932 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 13:18:45,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:18:45,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:18:45,934 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:18:45,934 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-18 13:18:45,957 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 13:18:45,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:45,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:46,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:46,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:18:46,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 13:18:46,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 61 transitions. Complement of second has 7 states. [2018-11-18 13:18:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:18:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 13:18:46,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 13:18:46,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:46,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 13:18:46,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:46,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 13:18:46,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:46,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 61 transitions. [2018-11-18 13:18:46,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:46,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 31 states and 39 transitions. [2018-11-18 13:18:46,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 13:18:46,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 13:18:46,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 13:18:46,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:18:46,056 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 13:18:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 13:18:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-18 13:18:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 13:18:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-18 13:18:46,060 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 13:18:46,060 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 13:18:46,060 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:18:46,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-18 13:18:46,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:46,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:46,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:46,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:46,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:46,063 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 318#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 327#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 335#L543-4 assume true; 336#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 329#L544-4 assume true; 330#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 342#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 340#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 339#L544-4 assume true; 337#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 331#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 332#L543-4 assume true; 319#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 320#L544-4 [2018-11-18 13:18:46,063 INFO L796 eck$LassoCheckResult]: Loop: 320#L544-4 assume true; 328#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 333#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 324#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 320#L544-4 [2018-11-18 13:18:46,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1305175541, now seen corresponding path program 1 times [2018-11-18 13:18:46,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:46,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:46,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:46,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:18:46,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f4b4bac-5dc6-4ff1-8693-aed4ac3a6132/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:18:46,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:46,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:46,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:18:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 13:18:46,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:18:46,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 2 times [2018-11-18 13:18:46,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:18:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:18:46,268 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-18 13:18:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:46,320 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-18 13:18:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:18:46,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2018-11-18 13:18:46,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:46,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 60 transitions. [2018-11-18 13:18:46,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 13:18:46,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 13:18:46,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-11-18 13:18:46,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:18:46,323 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-18 13:18:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-11-18 13:18:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-18 13:18:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 13:18:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-18 13:18:46,325 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 13:18:46,325 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 13:18:46,325 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:18:46,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2018-11-18 13:18:46,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:46,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:46,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:46,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:46,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:46,326 INFO L794 eck$LassoCheckResult]: Stem: 458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 453#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 462#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 471#L543-4 assume true; 472#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 485#L544-4 assume true; 484#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 483#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 482#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 464#L544-4 assume true; 465#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 469#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 470#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 476#L544-4 assume true; 473#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 466#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 467#L543-4 assume true; 454#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 455#L544-4 [2018-11-18 13:18:46,326 INFO L796 eck$LassoCheckResult]: Loop: 455#L544-4 assume true; 463#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 468#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 459#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 455#L544-4 [2018-11-18 13:18:46,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1505227724, now seen corresponding path program 2 times [2018-11-18 13:18:46,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 3 times [2018-11-18 13:18:46,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:46,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash 298555219, now seen corresponding path program 1 times [2018-11-18 13:18:46,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:46,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:46,699 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2018-11-18 13:18:46,746 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:18:46,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:18:46,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:18:46,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:18:46,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:18:46,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:46,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:18:46,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:18:46,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 13:18:46,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:18:46,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:18:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:46,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:18:47,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:18:47,056 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:18:47,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:47,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:47,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:47,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:47,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:47,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:47,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:47,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:47,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:47,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:47,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:47,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:47,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:47,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:47,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:47,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:47,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:47,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:47,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:47,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:47,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:47,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:47,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:47,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:47,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:47,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:47,089 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:18:47,108 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 13:18:47,108 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 13:18:47,109 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:18:47,109 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:18:47,110 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:18:47,110 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~x.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3) = -4*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~x.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 Supporting invariants [] [2018-11-18 13:18:47,149 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 13:18:47,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:18:47,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:47,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 13:18:47,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:18:47,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 62 transitions. Complement of second has 8 states. [2018-11-18 13:18:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:18:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-18 13:18:47,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 13:18:47,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:47,238 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:18:47,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:47,287 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 13:18:47,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:18:47,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 62 transitions. Complement of second has 8 states. [2018-11-18 13:18:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:18:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-18 13:18:47,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 13:18:47,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:47,307 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:18:47,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:47,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:47,353 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 13:18:47,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:18:47,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 56 states and 74 transitions. Complement of second has 7 states. [2018-11-18 13:18:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:18:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-18 13:18:47,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 13:18:47,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:47,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-18 13:18:47,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:47,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-18 13:18:47,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:47,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 74 transitions. [2018-11-18 13:18:47,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:18:47,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-18 13:18:47,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:18:47,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:18:47,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:18:47,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:18:47,395 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:47,395 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:47,395 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:47,395 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:18:47,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:18:47,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:18:47,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:18:47,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:18:47 BoogieIcfgContainer [2018-11-18 13:18:47,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:18:47,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:18:47,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:18:47,402 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:18:47,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:44" (3/4) ... [2018-11-18 13:18:47,405 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:18:47,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:18:47,406 INFO L168 Benchmark]: Toolchain (without parser) took 3934.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 955.7 MB in the beginning and 1.1 GB in the end (delta: -107.3 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,406 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:18:47,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,408 INFO L168 Benchmark]: Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,408 INFO L168 Benchmark]: RCFGBuilder took 175.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,409 INFO L168 Benchmark]: BuchiAutomizer took 3341.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:47,409 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:18:47,413 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3341.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 100 SDtfs, 91 SDslu, 66 SDs, 0 SdLazy, 83 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital159 mio100 ax100 hnf98 lsp95 ukn77 mio100 lsp64 div100 bol100 ite100 ukn100 eq178 hnf88 smp98 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...