./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/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 13fe1afeee88065faace0f9ad16456f5e678cf43 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:47:49,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:47:49,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:47:49,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:47:49,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:47:49,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:47:49,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:47:49,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:47:49,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:47:49,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:47:49,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:47:49,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:47:49,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:47:49,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:47:49,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:47:49,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:47:49,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:47:49,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:47:49,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:47:49,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:47:49,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:47:49,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:47:49,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:47:49,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:47:49,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:47:49,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:47:49,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:47:49,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:47:49,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:47:49,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:47:49,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:47:49,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:47:49,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:47:49,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:47:49,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:47:49,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:47:49,863 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 10:47:49,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:47:49,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:47:49,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:47:49,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:47:49,872 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:47:49,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:47:49,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:47:49,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:47:49,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:47:49,874 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:47:49,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:47:49,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:47:49,874 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:47:49,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:47:49,874 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_ed0a865b-c08d-428c-badf-e8fa77097913/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 -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-12-09 10:47:49,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:47:49,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:47:49,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:47:49,903 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:47:49,904 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:47:49,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-09 10:47:49,945 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/data/f3b371724/90b620a1c8264355a080d0b3a4cc13ed/FLAG0d1263b7a [2018-12-09 10:47:50,376 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:47:50,376 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-09 10:47:50,382 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/data/f3b371724/90b620a1c8264355a080d0b3a4cc13ed/FLAG0d1263b7a [2018-12-09 10:47:50,393 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/data/f3b371724/90b620a1c8264355a080d0b3a4cc13ed [2018-12-09 10:47:50,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:47:50,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:47:50,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:50,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:47:50,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:47:50,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50, skipping insertion in model container [2018-12-09 10:47:50,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:47:50,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:47:50,588 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:50,626 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:47:50,651 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:50,675 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:47:50,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50 WrapperNode [2018-12-09 10:47:50,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:50,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:50,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:47:50,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:47:50,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:50,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:47:50,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:47:50,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:47:50,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... [2018-12-09 10:47:50,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:47:50,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:47:50,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:47:50,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:47:50,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/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-12-09 10:47:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:47:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:47:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:47:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:47:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:47:50,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:47:50,890 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:47:50,891 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-09 10:47:50,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:50 BoogieIcfgContainer [2018-12-09 10:47:50,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:47:50,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:47:50,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:47:50,893 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:47:50,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:50,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:47:50" (1/3) ... [2018-12-09 10:47:50,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a8394c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:50, skipping insertion in model container [2018-12-09 10:47:50,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:50,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:50" (2/3) ... [2018-12-09 10:47:50,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a8394c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:50, skipping insertion in model container [2018-12-09 10:47:50,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:50,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:50" (3/3) ... [2018-12-09 10:47:50,896 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-12-09 10:47:50,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:47:50,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:47:50,926 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:47:50,926 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:47:50,927 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:47:50,927 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:47:50,927 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:47:50,927 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:47:50,927 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:47:50,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-09 10:47:50,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-09 10:47:50,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:50,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:50,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 10:47:50,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:47:50,955 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:47:50,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-09 10:47:50,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-09 10:47:50,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:50,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:50,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 10:47:50,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:47:50,964 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8#L558-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 16#L545-3true [2018-12-09 10:47:50,964 INFO L796 eck$LassoCheckResult]: Loop: 16#L545-3true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13#L545-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16#L545-3true [2018-12-09 10:47:50,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-09 10:47:50,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:50,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:51,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2018-12-09 10:47:51,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:51,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2018-12-09 10:47:51,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:51,309 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:51,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:51,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:51,310 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:51,310 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:51,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:51,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:51,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:51,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-09 10:47:51,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:51,311 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:51,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:51,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:51,818 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:51,820 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-12-09 10:47:51,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,825 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-12-09 10:47:51,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,830 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-12-09 10:47:51,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,832 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-12-09 10:47:51,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,834 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-12-09 10:47:51,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,836 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-12-09 10:47:51,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,839 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-12-09 10:47:51,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,841 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-12-09 10:47:51,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,850 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-12-09 10:47:51,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,853 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-12-09 10:47:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,855 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-12-09 10:47:51,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,857 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-12-09 10:47:51,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,863 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-12-09 10:47:51,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,865 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-12-09 10:47:51,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,867 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-12-09 10:47:51,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,869 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-12-09 10:47:51,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,870 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-12-09 10:47:51,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,872 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-12-09 10:47:51,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,874 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-12-09 10:47:51,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:51,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:51,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:51,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,876 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-12-09 10:47:51,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,880 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-12-09 10:47:51,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,884 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-12-09 10:47:51,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:47:51,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:47:51,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:51,896 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-12-09 10:47:51,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:51,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:51,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:51,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:51,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:51,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:51,958 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:52,003 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 10:47:52,003 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 10:47:52,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:52,006 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:47:52,007 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:52,007 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-12-09 10:47:52,042 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-09 10:47:52,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,104 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-12-09 10:47:52,105 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-12-09 10:47:52,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2018-12-09 10:47:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:47:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-12-09 10:47:52,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 10:47:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-09 10:47:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-09 10:47:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2018-12-09 10:47:52,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 10:47:52,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2018-12-09 10:47:52,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 10:47:52,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 10:47:52,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2018-12-09 10:47:52,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:47:52,142 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-09 10:47:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2018-12-09 10:47:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 10:47:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 10:47:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-12-09 10:47:52,159 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-09 10:47:52,159 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-09 10:47:52,159 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:47:52,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2018-12-09 10:47:52,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 10:47:52,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:52,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:52,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:47:52,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:47:52,160 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 175#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 176#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 180#L545-3 assume !(lis_~i~0 < lis_~N); 188#L545-4 lis_~i~0 := 1; 183#L547-3 [2018-12-09 10:47:52,160 INFO L796 eck$LassoCheckResult]: Loop: 183#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 179#L548-3 assume !(lis_~j~0 < lis_~i~0); 181#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 183#L547-3 [2018-12-09 10:47:52,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2018-12-09 10:47:52,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:47:52,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:47:52,193 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:52,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2018-12-09 10:47:52,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,207 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:52,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:52,207 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:52,207 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:52,208 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:52,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:52,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:52,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:52,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-09 10:47:52,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:52,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:52,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:52,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:52,241 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:52,241 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:52,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:52,244 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:52,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:52,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:52,364 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:52,365 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:52,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:52,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:52,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:52,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:52,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:52,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:52,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:52,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-09 10:47:52,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:52,366 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:52,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:52,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:52,412 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:52,413 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-12-09 10:47:52,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:52,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:52,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:52,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:52,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:52,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:52,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:52,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:52,417 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 10:47:52,417 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:52,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:52,418 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:52,418 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:52,418 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2018-12-09 10:47:52,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:52,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:47:52,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-09 10:47:52,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 49 states and 84 transitions. Complement of second has 10 states. [2018-12-09 10:47:52,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:47:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-12-09 10:47:52,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 10:47:52,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 10:47:52,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-09 10:47:52,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:52,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2018-12-09 10:47:52,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 10:47:52,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2018-12-09 10:47:52,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-09 10:47:52,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:47:52,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2018-12-09 10:47:52,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:52,529 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2018-12-09 10:47:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2018-12-09 10:47:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-12-09 10:47:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:47:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-09 10:47:52,531 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-09 10:47:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:47:52,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:47:52,533 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-12-09 10:47:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:52,562 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2018-12-09 10:47:52,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:47:52,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2018-12-09 10:47:52,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:52,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2018-12-09 10:47:52,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-09 10:47:52,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-09 10:47:52,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-12-09 10:47:52,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:52,564 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-12-09 10:47:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-12-09 10:47:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-09 10:47:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:47:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-12-09 10:47:52,565 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-12-09 10:47:52,565 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-12-09 10:47:52,565 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:47:52,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2018-12-09 10:47:52,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:52,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:52,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:52,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:52,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:52,566 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 360#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 361#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 368#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 379#L545-3 assume !(lis_~i~0 < lis_~N); 381#L545-4 lis_~i~0 := 1; 384#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-12-09 10:47:52,566 INFO L796 eck$LassoCheckResult]: Loop: 369#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 370#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 362#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 363#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 366#L548-3 assume !(lis_~j~0 < lis_~i~0); 373#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 374#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-12-09 10:47:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2018-12-09 10:47:52,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:52,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-09 10:47:52,641 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:52,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2018-12-09 10:47:52,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,768 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-09 10:47:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:47:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:47:52,814 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-12-09 10:47:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:52,885 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2018-12-09 10:47:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:47:52,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2018-12-09 10:47:52,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-09 10:47:52,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2018-12-09 10:47:52,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 10:47:52,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 10:47:52,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2018-12-09 10:47:52,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:52,887 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2018-12-09 10:47:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2018-12-09 10:47:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-12-09 10:47:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 10:47:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-12-09 10:47:52,888 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-09 10:47:52,888 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-09 10:47:52,889 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:47:52,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-12-09 10:47:52,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:52,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:52,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:52,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:52,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:52,890 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 487#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 488#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 495#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 506#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 507#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 510#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 514#L545-3 assume !(lis_~i~0 < lis_~N); 513#L545-4 lis_~i~0 := 1; 505#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-12-09 10:47:52,890 INFO L796 eck$LassoCheckResult]: Loop: 496#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 497#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 489#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 490#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 493#L548-3 assume !(lis_~j~0 < lis_~i~0); 501#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 502#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-12-09 10:47:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2018-12-09 10:47:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2018-12-09 10:47:52,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:52,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2018-12-09 10:47:52,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:52,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:52,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:52,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:47:53,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:53,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-09 10:47:53,184 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-12-09 10:47:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:47:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:47:53,219 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2018-12-09 10:47:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:53,375 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2018-12-09 10:47:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:47:53,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2018-12-09 10:47:53,377 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2018-12-09 10:47:53,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2018-12-09 10:47:53,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-12-09 10:47:53,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-09 10:47:53,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2018-12-09 10:47:53,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:53,377 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2018-12-09 10:47:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2018-12-09 10:47:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2018-12-09 10:47:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 10:47:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-12-09 10:47:53,379 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-09 10:47:53,380 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-09 10:47:53,380 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:47:53,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-12-09 10:47:53,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-09 10:47:53,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:53,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:53,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:53,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:53,381 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 732#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 710#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 711#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 719#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 733#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 734#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 735#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 744#L545-3 assume !(lis_~i~0 < lis_~N); 738#L545-4 lis_~i~0 := 1; 727#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 717#L548-3 [2018-12-09 10:47:53,381 INFO L796 eck$LassoCheckResult]: Loop: 717#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 746#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 745#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 716#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 717#L548-3 [2018-12-09 10:47:53,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2018-12-09 10:47:53,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:53,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2018-12-09 10:47:53,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2018-12-09 10:47:53,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:53,832 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2018-12-09 10:47:53,935 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-09 10:47:53,937 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:53,937 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:53,937 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:53,937 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:53,937 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:53,937 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:53,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:53,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:53,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-09 10:47:53,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:53,938 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:53,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:53,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,447 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-12-09 10:47:54,603 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-12-09 10:47:54,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:54,767 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-09 10:47:55,029 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:55,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:55,029 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-12-09 10:47:55,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:55,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:55,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,031 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-12-09 10:47:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,032 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-12-09 10:47:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,033 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-12-09 10:47:55,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,034 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-12-09 10:47:55,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,035 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-12-09 10:47:55,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:55,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:55,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,037 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-12-09 10:47:55,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,038 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-12-09 10:47:55,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:55,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:55,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:55,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,039 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-12-09 10:47:55,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,039 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:47:55,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:47:55,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:55,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,042 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-12-09 10:47:55,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:55,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:55,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:55,045 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-12-09 10:47:55,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:55,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:55,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:55,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:55,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:47:55,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:47:55,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:55,083 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:47:55,083 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 10:47:55,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:55,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:47:55,084 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:55,084 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-12-09 10:47:55,190 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2018-12-09 10:47:55,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:55,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:55,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:55,255 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 10:47:55,255 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-09 10:47:55,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 65 states and 98 transitions. Complement of second has 9 states. [2018-12-09 10:47:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:47:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-09 10:47:55,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:47:55,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:55,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 10:47:55,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:55,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-09 10:47:55,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:55,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2018-12-09 10:47:55,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:55,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2018-12-09 10:47:55,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 10:47:55,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 10:47:55,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2018-12-09 10:47:55,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:55,300 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-12-09 10:47:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2018-12-09 10:47:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-12-09 10:47:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 10:47:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-12-09 10:47:55,302 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-12-09 10:47:55,302 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-12-09 10:47:55,302 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:47:55,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2018-12-09 10:47:55,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:55,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:55,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:55,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:55,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:55,303 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1066#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1067#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1075#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1085#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1086#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1088#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1097#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1095#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1094#L545-3 assume !(lis_~i~0 < lis_~N); 1091#L545-4 lis_~i~0 := 1; 1082#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1083#L548-3 assume !(lis_~j~0 < lis_~i~0); 1099#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1098#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-12-09 10:47:55,303 INFO L796 eck$LassoCheckResult]: Loop: 1096#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1092#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1068#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1069#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1072#L548-3 assume !(lis_~j~0 < lis_~i~0); 1078#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1079#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-12-09 10:47:55,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2018-12-09 10:47:55,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:55,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 10:47:55,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:47:55,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:47:55,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:55,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2018-12-09 10:47:55,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,480 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-09 10:47:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:47:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:47:55,523 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-12-09 10:47:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:55,545 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2018-12-09 10:47:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:47:55,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2018-12-09 10:47:55,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:55,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2018-12-09 10:47:55,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 10:47:55,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 10:47:55,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2018-12-09 10:47:55,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:55,547 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-12-09 10:47:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2018-12-09 10:47:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-12-09 10:47:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 10:47:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-12-09 10:47:55,548 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-09 10:47:55,548 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-09 10:47:55,548 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:47:55,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-12-09 10:47:55,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:55,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:55,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:55,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:55,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:55,549 INFO L794 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1184#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1162#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1163#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1170#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1182#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1183#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1185#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1193#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1192#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1191#L545-3 assume !(lis_~i~0 < lis_~N); 1188#L545-4 lis_~i~0 := 1; 1189#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1171#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1172#L549 assume !lis_#t~short11; 1198#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 1197#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1196#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-12-09 10:47:55,549 INFO L796 eck$LassoCheckResult]: Loop: 1175#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1176#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1180#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1190#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1164#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1165#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-12-09 10:47:55,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2018-12-09 10:47:55,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2018-12-09 10:47:55,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2018-12-09 10:47:55,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 10:47:55,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:55,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:55,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:55,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 10:47:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-12-09 10:47:55,811 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-09 10:47:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:47:55,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:47:55,851 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-12-09 10:47:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:55,924 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-12-09 10:47:55,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:47:55,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2018-12-09 10:47:55,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 10:47:55,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2018-12-09 10:47:55,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 10:47:55,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 10:47:55,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2018-12-09 10:47:55,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:47:55,926 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-09 10:47:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2018-12-09 10:47:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-09 10:47:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 10:47:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-12-09 10:47:55,927 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-12-09 10:47:55,927 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-12-09 10:47:55,927 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 10:47:55,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-12-09 10:47:55,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-12-09 10:47:55,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:55,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:55,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:55,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-09 10:47:55,928 INFO L794 eck$LassoCheckResult]: Stem: 1373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1371#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1353#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1354#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1362#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1369#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1370#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1372#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1380#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1377#L545-3 assume !(lis_~i~0 < lis_~N); 1375#L545-4 lis_~i~0 := 1; 1376#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1379#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1365#L549 assume !lis_#t~short11; 1357#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 1358#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1361#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-12-09 10:47:55,928 INFO L796 eck$LassoCheckResult]: Loop: 1364#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1366#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1368#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1383#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1382#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1359#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1360#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1363#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1355#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1356#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1381#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-12-09 10:47:55,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2018-12-09 10:47:55,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2018-12-09 10:47:55,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:55,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2018-12-09 10:47:55,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:47:56,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:56,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:47:56,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:47:56,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:47:56,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:56,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 10:47:56,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 10:47:56,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-09 10:47:56,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-09 10:47:56,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:47:56,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 10:47:56,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:47:56,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-12-09 10:47:56,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-09 10:47:56,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 10:47:56,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-12-09 10:47:56,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:56,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 10:47:56,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:56,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-12-09 10:47:57,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-12-09 10:47:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:47:57,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 119 [2018-12-09 10:47:57,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:57,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-12-09 10:47:57,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,066 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:47:57,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:47:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2018-12-09 10:47:57,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:47:57,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:57,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:47:57,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 10:47:57,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2018-12-09 10:47:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:47:57,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:57,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-12-09 10:47:57,568 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-12-09 10:47:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 10:47:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-12-09 10:47:57,647 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 28 states. [2018-12-09 10:47:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:59,396 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-12-09 10:47:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 10:47:59,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 134 transitions. [2018-12-09 10:47:59,397 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2018-12-09 10:47:59,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 134 transitions. [2018-12-09 10:47:59,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-12-09 10:47:59,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-12-09 10:47:59,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 134 transitions. [2018-12-09 10:47:59,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:47:59,399 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 134 transitions. [2018-12-09 10:47:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 134 transitions. [2018-12-09 10:47:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2018-12-09 10:47:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 10:47:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-12-09 10:47:59,402 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-09 10:47:59,402 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-09 10:47:59,402 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 10:47:59,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 71 transitions. [2018-12-09 10:47:59,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-09 10:47:59,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:59,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:59,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:59,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-09 10:47:59,403 INFO L794 eck$LassoCheckResult]: Stem: 1679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1676#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1658#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1659#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1667#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1677#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1678#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1674#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1675#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1688#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1687#L545-3 assume !(lis_~i~0 < lis_~N); 1681#L545-4 lis_~i~0 := 1; 1682#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1689#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1684#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1685#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1663#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1666#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-12-09 10:47:59,403 INFO L796 eck$LassoCheckResult]: Loop: 1669#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1671#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1673#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1696#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1694#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1664#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1665#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1668#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1697#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1693#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-12-09 10:47:59,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1306550290, now seen corresponding path program 1 times [2018-12-09 10:47:59,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:59,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 6 times [2018-12-09 10:47:59,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:59,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2097927870, now seen corresponding path program 2 times [2018-12-09 10:47:59,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:59,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:59,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,803 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-12-09 10:48:01,667 WARN L180 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 227 DAG size of output: 167 [2018-12-09 10:48:01,987 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-12-09 10:48:01,989 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:48:01,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:48:01,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:48:01,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:48:01,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:48:01,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:48:01,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:48:01,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:48:01,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration9_Lasso [2018-12-09 10:48:01,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:48:01,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:48:01,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,181 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-12-09 10:48:03,560 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 116 [2018-12-09 10:48:03,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,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-12-09 10:48:03,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-12-09 10:48:03,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,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-12-09 10:48:03,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-12-09 10:48:03,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-12-09 10:48:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,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-12-09 10:48:03,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:03,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:48:03,980 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:48:03,980 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-12-09 10:48:03,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,982 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-12-09 10:48:03,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:03,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:03,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,985 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-12-09 10:48:03,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:03,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:03,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:48:04,000 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 10:48:04,000 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:48:04,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:48:04,001 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:48:04,001 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:48:04,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 Supporting invariants [] [2018-12-09 10:48:04,343 INFO L297 tatePredicateManager]: 69 out of 70 supporting invariants were superfluous and have been removed [2018-12-09 10:48:04,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:48:04,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:48:04,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:04,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:04,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 10:48:04,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 10:48:04,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 10:48:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:04,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:04,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2018-12-09 10:48:04,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 138 [2018-12-09 10:48:04,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-09 10:48:04,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-09 10:48:04,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:04,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-12-09 10:48:04,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:04,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-12-09 10:48:04,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:04,550 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 10:48:04,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 10:48:04,594 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:106, output treesize:192 [2018-12-09 10:48:04,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-12-09 10:48:04,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,836 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:04,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 212 [2018-12-09 10:48:04,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 106 [2018-12-09 10:48:04,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-12-09 10:48:04,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 132 [2018-12-09 10:48:04,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 248 [2018-12-09 10:48:04,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:04,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 101 [2018-12-09 10:48:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-12-09 10:48:04,995 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:05,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:05,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:05,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:05,037 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:303, output treesize:191 [2018-12-09 10:48:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:05,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-12-09 10:48:05,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-12-09 10:48:05,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 117 states and 162 transitions. Complement of second has 22 states. [2018-12-09 10:48:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-12-09 10:48:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-09 10:48:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-12-09 10:48:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 11 letters. [2018-12-09 10:48:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 29 letters. Loop has 11 letters. [2018-12-09 10:48:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 22 letters. [2018-12-09 10:48:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:05,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 162 transitions. [2018-12-09 10:48:05,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-09 10:48:05,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 90 states and 121 transitions. [2018-12-09 10:48:05,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-12-09 10:48:05,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-12-09 10:48:05,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 121 transitions. [2018-12-09 10:48:05,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:05,753 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-12-09 10:48:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 121 transitions. [2018-12-09 10:48:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-12-09 10:48:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 10:48:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-12-09 10:48:05,755 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-12-09 10:48:05,755 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-12-09 10:48:05,755 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 10:48:05,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 98 transitions. [2018-12-09 10:48:05,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-09 10:48:05,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:05,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:05,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:05,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:48:05,756 INFO L794 eck$LassoCheckResult]: Stem: 2280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2277#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2254#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2255#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2263#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2278#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2279#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2275#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2276#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2289#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2288#L545-3 assume !(lis_~i~0 < lis_~N); 2282#L545-4 lis_~i~0 := 1; 2283#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2300#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2298#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2296#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2261#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2262#L548-3 assume !(lis_~j~0 < lis_~i~0); 2295#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2272#L547-3 assume !(lis_~i~0 < lis_~N); 2273#L547-4 lis_~i~0 := 0; 2252#L551-3 [2018-12-09 10:48:05,756 INFO L796 eck$LassoCheckResult]: Loop: 2252#L551-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 2253#L552 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 2281#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 2252#L551-3 [2018-12-09 10:48:05,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2018-12-09 10:48:05,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:05,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:05,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:05,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:05,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:48:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-12-09 10:48:05,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:05,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2018-12-09 10:48:05,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 10:48:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:48:05,912 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. cyclomatic complexity: 31 Second operand 16 states. [2018-12-09 10:48:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:06,036 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2018-12-09 10:48:06,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:48:06,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 141 transitions. [2018-12-09 10:48:06,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-09 10:48:06,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 141 transitions. [2018-12-09 10:48:06,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-12-09 10:48:06,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-12-09 10:48:06,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 141 transitions. [2018-12-09 10:48:06,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:06,038 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 141 transitions. [2018-12-09 10:48:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 141 transitions. [2018-12-09 10:48:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2018-12-09 10:48:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 10:48:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2018-12-09 10:48:06,041 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-12-09 10:48:06,041 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-12-09 10:48:06,041 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 10:48:06,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2018-12-09 10:48:06,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-09 10:48:06,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:06,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:06,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:06,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:06,042 INFO L794 eck$LassoCheckResult]: Stem: 2551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2548#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2525#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2526#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2534#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2549#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2550#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2545#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2546#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2557#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2556#L545-3 assume !(lis_~i~0 < lis_~N); 2553#L545-4 lis_~i~0 := 1; 2554#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2573#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2571#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2568#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2567#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2565#L548-3 assume !(lis_~j~0 < lis_~i~0); 2564#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2544#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2535#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2536#L549 assume !lis_#t~short11; 2527#L549-2 [2018-12-09 10:48:06,042 INFO L796 eck$LassoCheckResult]: Loop: 2527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 2528#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2581#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2580#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2578#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2575#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2576#L548-3 assume !(lis_~j~0 < lis_~i~0); 2558#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2559#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2594#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2593#L549 assume !lis_#t~short11; 2527#L549-2 [2018-12-09 10:48:06,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2018-12-09 10:48:06,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 1 times [2018-12-09 10:48:06,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 183297546, now seen corresponding path program 3 times [2018-12-09 10:48:06,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:48:06,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:06,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 10:48:06,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 10:48:06,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:48:06,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:48:06,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:06,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-09 10:48:06,483 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-12-09 10:48:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 10:48:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-12-09 10:48:06,536 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. cyclomatic complexity: 30 Second operand 20 states. [2018-12-09 10:48:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:06,738 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-12-09 10:48:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:48:06,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 187 transitions. [2018-12-09 10:48:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-12-09 10:48:06,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 186 transitions. [2018-12-09 10:48:06,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-12-09 10:48:06,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-09 10:48:06,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 186 transitions. [2018-12-09 10:48:06,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:06,740 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 186 transitions. [2018-12-09 10:48:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 186 transitions. [2018-12-09 10:48:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2018-12-09 10:48:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 10:48:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2018-12-09 10:48:06,743 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-12-09 10:48:06,743 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-12-09 10:48:06,743 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 10:48:06,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 167 transitions. [2018-12-09 10:48:06,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-09 10:48:06,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:06,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:06,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:06,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:06,744 INFO L794 eck$LassoCheckResult]: Stem: 2907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2904#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2882#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2883#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2891#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2905#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2906#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2902#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2903#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2932#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2928#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2929#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2931#L545-3 assume !(lis_~i~0 < lis_~N); 2930#L545-4 lis_~i~0 := 1; 2927#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2926#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2924#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2921#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2920#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2918#L548-3 assume !(lis_~j~0 < lis_~i~0); 2915#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2916#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3003#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3002#L549 assume !lis_#t~short11; 2968#L549-2 [2018-12-09 10:48:06,744 INFO L796 eck$LassoCheckResult]: Loop: 2968#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 2965#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2995#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2958#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2945#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2946#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L548-3 assume !(lis_~j~0 < lis_~i~0); 2971#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2970#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2969#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2967#L549 assume !lis_#t~short11; 2968#L549-2 [2018-12-09 10:48:06,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 2 times [2018-12-09 10:48:06,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 2 times [2018-12-09 10:48:06,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:06,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1101378456, now seen corresponding path program 4 times [2018-12-09 10:48:06,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:06,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:06,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:06,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:08,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:08,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:08,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 10:48:08,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 10:48:08,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:48:08,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:08,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:08,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 10:48:08,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:08,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:08,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 10:48:08,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 10:48:08,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-12-09 10:48:08,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:08,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:08,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 36 [2018-12-09 10:48:08,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-12-09 10:48:08,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 10:48:08,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:08,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 10:48:08,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-12-09 10:48:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 10:48:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2018-12-09 10:48:08,839 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-12-09 10:48:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 10:48:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 10:48:08,893 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. cyclomatic complexity: 47 Second operand 33 states. [2018-12-09 10:48:09,974 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-09 10:48:10,824 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-09 10:48:11,133 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-12-09 10:48:11,315 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-12-09 10:48:12,176 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-12-09 10:48:12,613 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-12-09 10:48:12,817 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-09 10:48:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:15,416 INFO L93 Difference]: Finished difference Result 399 states and 518 transitions. [2018-12-09 10:48:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-09 10:48:15,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 518 transitions. [2018-12-09 10:48:15,418 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 96 [2018-12-09 10:48:15,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 394 states and 513 transitions. [2018-12-09 10:48:15,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2018-12-09 10:48:15,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2018-12-09 10:48:15,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 394 states and 513 transitions. [2018-12-09 10:48:15,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:15,420 INFO L705 BuchiCegarLoop]: Abstraction has 394 states and 513 transitions. [2018-12-09 10:48:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 513 transitions. [2018-12-09 10:48:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 228. [2018-12-09 10:48:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-09 10:48:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 306 transitions. [2018-12-09 10:48:15,424 INFO L728 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-12-09 10:48:15,424 INFO L608 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-12-09 10:48:15,424 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 10:48:15,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 306 transitions. [2018-12-09 10:48:15,425 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2018-12-09 10:48:15,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:15,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:15,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:15,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-09 10:48:15,425 INFO L794 eck$LassoCheckResult]: Stem: 3711#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3708#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3685#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3686#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3694#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3709#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3742#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3741#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3740#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3739#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3738#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3737#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3736#L545-3 assume !(lis_~i~0 < lis_~N); 3735#L545-4 lis_~i~0 := 1; 3734#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3732#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3729#L549 assume !lis_#t~short11; 3730#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 3744#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3751#L548-3 assume !(lis_~j~0 < lis_~i~0); 3749#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3750#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3799#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3797#L549 assume !lis_#t~short11; 3798#L549-2 [2018-12-09 10:48:15,426 INFO L796 eck$LassoCheckResult]: Loop: 3798#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 3796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3885#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3824#L549 assume !lis_#t~short11; 3882#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 3850#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3823#L548-3 assume !(lis_~j~0 < lis_~i~0); 3819#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3816#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3813#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3809#L549 assume !lis_#t~short11; 3798#L549-2 [2018-12-09 10:48:15,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash -896946752, now seen corresponding path program 1 times [2018-12-09 10:48:15,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:15,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:15,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2018-12-09 10:48:15,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:15,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash 476161128, now seen corresponding path program 2 times [2018-12-09 10:48:15,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:15,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:17,608 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 243 DAG size of output: 181 [2018-12-09 10:48:18,127 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-09 10:48:18,129 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:48:18,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:48:18,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:48:18,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:48:18,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:48:18,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:48:18,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:48:18,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:48:18,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-12-09 10:48:18,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:48:18,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:48:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:18,998 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 117 [2018-12-09 10:48:19,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:19,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:48:19,460 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:48:19,460 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-12-09 10:48:19,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,462 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-12-09 10:48:19,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,463 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-12-09 10:48:19,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,465 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-12-09 10:48:19,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,467 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-12-09 10:48:19,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,469 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-12-09 10:48:19,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,470 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-12-09 10:48:19,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,472 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-12-09 10:48:19,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,473 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-12-09 10:48:19,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,474 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-12-09 10:48:19,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,475 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-12-09 10:48:19,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,477 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-12-09 10:48:19,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,478 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-12-09 10:48:19,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,479 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-12-09 10:48:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,481 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-12-09 10:48:19,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,482 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-12-09 10:48:19,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:19,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:19,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:19,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,484 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-12-09 10:48:19,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,486 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-12-09 10:48:19,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,488 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-12-09 10:48:19,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,491 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-12-09 10:48:19,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,495 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-12-09 10:48:19,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,498 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-12-09 10:48:19,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,499 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-12-09 10:48:19,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,501 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-12-09 10:48:19,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,502 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-12-09 10:48:19,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:19,503 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-12-09 10:48:19,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:19,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:19,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:19,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:19,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:19,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:19,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:48:19,528 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:48:19,528 INFO L444 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 10:48:19,528 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:48:19,529 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:48:19,529 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:48:19,529 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 5 Supporting invariants [] [2018-12-09 10:48:19,685 INFO L297 tatePredicateManager]: 55 out of 56 supporting invariants were superfluous and have been removed [2018-12-09 10:48:19,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:19,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:19,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:19,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-09 10:48:19,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88 Second operand 9 states. [2018-12-09 10:48:19,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88. Second operand 9 states. Result 558 states and 763 transitions. Complement of second has 15 states. [2018-12-09 10:48:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 5 non-accepting loop states 2 accepting loop states [2018-12-09 10:48:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 10:48:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2018-12-09 10:48:19,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 11 letters. [2018-12-09 10:48:19,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:19,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 35 letters. Loop has 11 letters. [2018-12-09 10:48:19,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:19,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 22 letters. [2018-12-09 10:48:19,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:19,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 558 states and 763 transitions. [2018-12-09 10:48:19,833 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2018-12-09 10:48:19,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 558 states to 525 states and 714 transitions. [2018-12-09 10:48:19,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 363 [2018-12-09 10:48:19,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2018-12-09 10:48:19,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 714 transitions. [2018-12-09 10:48:19,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:19,836 INFO L705 BuchiCegarLoop]: Abstraction has 525 states and 714 transitions. [2018-12-09 10:48:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 714 transitions. [2018-12-09 10:48:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 439. [2018-12-09 10:48:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-09 10:48:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 604 transitions. [2018-12-09 10:48:19,845 INFO L728 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-12-09 10:48:19,845 INFO L608 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-12-09 10:48:19,845 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 10:48:19,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 439 states and 604 transitions. [2018-12-09 10:48:19,846 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 77 [2018-12-09 10:48:19,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:19,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:19,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:19,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:48:19,847 INFO L794 eck$LassoCheckResult]: Stem: 4879#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4875#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4851#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4852#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4860#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4876#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4891#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4894#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4877#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4878#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4954#L545-3 assume !(lis_~i~0 < lis_~N); 4881#L545-4 lis_~i~0 := 1; 4882#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5043#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5041#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5038#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5039#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5067#L548-3 assume !(lis_~j~0 < lis_~i~0); 5065#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5066#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5168#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5169#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5192#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 5172#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5255#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5072#L549 [2018-12-09 10:48:19,848 INFO L796 eck$LassoCheckResult]: Loop: 5072#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5254#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5253#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5071#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5072#L549 [2018-12-09 10:48:19,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash -565876855, now seen corresponding path program 1 times [2018-12-09 10:48:19,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:19,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:20,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:20,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:20,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:20,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 10:48:20,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 10:48:20,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-12-09 10:48:20,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-09 10:48:20,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:20,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 10:48:20,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:20,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-09 10:48:20,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-09 10:48:20,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 10:48:20,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-12-09 10:48:20,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 10:48:20,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-12-09 10:48:20,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 93 [2018-12-09 10:48:20,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:20,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-12-09 10:48:20,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74 [2018-12-09 10:48:20,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,436 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:20,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:20,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-09 10:48:20,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:20,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 10:48:20,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61 [2018-12-09 10:48:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:20,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:20,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-12-09 10:48:20,581 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:20,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 2 times [2018-12-09 10:48:20,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:20,711 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:48:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 10:48:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-09 10:48:20,802 INFO L87 Difference]: Start difference. First operand 439 states and 604 transitions. cyclomatic complexity: 183 Second operand 28 states. [2018-12-09 10:48:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:25,441 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions. [2018-12-09 10:48:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-09 10:48:25,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 900 transitions. [2018-12-09 10:48:25,446 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 160 [2018-12-09 10:48:25,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 655 states and 880 transitions. [2018-12-09 10:48:25,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2018-12-09 10:48:25,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2018-12-09 10:48:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 655 states and 880 transitions. [2018-12-09 10:48:25,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:25,450 INFO L705 BuchiCegarLoop]: Abstraction has 655 states and 880 transitions. [2018-12-09 10:48:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 880 transitions. [2018-12-09 10:48:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 367. [2018-12-09 10:48:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 10:48:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 494 transitions. [2018-12-09 10:48:25,459 INFO L728 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-12-09 10:48:25,459 INFO L608 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-12-09 10:48:25,459 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 10:48:25,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 494 transitions. [2018-12-09 10:48:25,461 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 61 [2018-12-09 10:48:25,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:25,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:25,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:25,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:25,462 INFO L794 eck$LassoCheckResult]: Stem: 6203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6199#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6174#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6175#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6183#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6200#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6212#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6213#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6201#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6202#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6211#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6196#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6197#L545-3 assume !(lis_~i~0 < lis_~N); 6228#L545-4 lis_~i~0 := 1; 6245#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6243#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6240#L549 assume !lis_#t~short11; 6222#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 6238#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6233#L548-3 assume !(lis_~j~0 < lis_~i~0); 6234#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6193#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6195#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6506#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6507#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 6177#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6500#L548-3 [2018-12-09 10:48:25,462 INFO L796 eck$LassoCheckResult]: Loop: 6500#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6531#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6455#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6452#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6356#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6357#L549 assume !lis_#t~short11; 6295#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 6478#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6520#L548-3 assume !(lis_~j~0 < lis_~i~0); 6511#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6501#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6500#L548-3 [2018-12-09 10:48:25,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1322597504, now seen corresponding path program 1 times [2018-12-09 10:48:25,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:25,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:25,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:48:25,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:25,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:25,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:25,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:25,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 10:48:25,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 10:48:25,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-12-09 10:48:25,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-09 10:48:25,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:25,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 10:48:25,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:25,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-09 10:48:25,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-12-09 10:48:25,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 10:48:25,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-12-09 10:48:25,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-12-09 10:48:25,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-12-09 10:48:25,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 10:48:25,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-12-09 10:48:25,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-12-09 10:48:25,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:25,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-12-09 10:48:25,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:25,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:79, output treesize:62 [2018-12-09 10:48:26,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 76 [2018-12-09 10:48:26,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 10:48:26,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:26,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-12-09 10:48:26,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:26,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 157 [2018-12-09 10:48:26,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:26,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:26,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:26,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 10:48:26,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:80 [2018-12-09 10:48:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:48:26,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:26,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-12-09 10:48:26,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:26,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 237530077, now seen corresponding path program 3 times [2018-12-09 10:48:26,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:26,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:26,430 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-12-09 10:48:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 10:48:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-09 10:48:26,470 INFO L87 Difference]: Start difference. First operand 367 states and 494 transitions. cyclomatic complexity: 139 Second operand 25 states. [2018-12-09 10:48:26,977 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-09 10:48:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:29,358 INFO L93 Difference]: Finished difference Result 548 states and 718 transitions. [2018-12-09 10:48:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 10:48:29,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 718 transitions. [2018-12-09 10:48:29,363 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 123 [2018-12-09 10:48:29,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 718 transitions. [2018-12-09 10:48:29,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2018-12-09 10:48:29,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2018-12-09 10:48:29,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 718 transitions. [2018-12-09 10:48:29,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:29,369 INFO L705 BuchiCegarLoop]: Abstraction has 548 states and 718 transitions. [2018-12-09 10:48:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 718 transitions. [2018-12-09 10:48:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 331. [2018-12-09 10:48:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-09 10:48:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 438 transitions. [2018-12-09 10:48:29,381 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-12-09 10:48:29,382 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-12-09 10:48:29,382 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 10:48:29,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 438 transitions. [2018-12-09 10:48:29,383 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2018-12-09 10:48:29,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:29,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:29,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:29,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:48:29,385 INFO L794 eck$LassoCheckResult]: Stem: 7285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7281#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7256#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7257#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7265#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7282#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7297#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7298#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7283#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7284#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7292#L545-3 assume !(lis_~i~0 < lis_~N); 7287#L545-4 lis_~i~0 := 1; 7288#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7394#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7393#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7390#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7388#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7389#L548-3 assume !(lis_~j~0 < lis_~i~0); 7384#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7273#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7274#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7510#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7511#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7522#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7521#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7519#L549 assume !lis_#t~short11; 7520#L549-2 [2018-12-09 10:48:29,385 INFO L796 eck$LassoCheckResult]: Loop: 7520#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 7515#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7573#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7574#L549 assume !lis_#t~short11; 7520#L549-2 [2018-12-09 10:48:29,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash -362372859, now seen corresponding path program 3 times [2018-12-09 10:48:29,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 1 times [2018-12-09 10:48:29,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 613161260, now seen corresponding path program 5 times [2018-12-09 10:48:29,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 10:48:29,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:29,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:29,486 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 10:48:29,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 10:48:29,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:48:29,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:48:29,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:29,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-12-09 10:48:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 10:48:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:48:29,668 INFO L87 Difference]: Start difference. First operand 331 states and 438 transitions. cyclomatic complexity: 120 Second operand 17 states. [2018-12-09 10:48:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:29,849 INFO L93 Difference]: Finished difference Result 418 states and 526 transitions. [2018-12-09 10:48:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:48:29,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 526 transitions. [2018-12-09 10:48:29,850 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 59 [2018-12-09 10:48:29,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 376 states and 481 transitions. [2018-12-09 10:48:29,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2018-12-09 10:48:29,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-12-09 10:48:29,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 481 transitions. [2018-12-09 10:48:29,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:29,852 INFO L705 BuchiCegarLoop]: Abstraction has 376 states and 481 transitions. [2018-12-09 10:48:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 481 transitions. [2018-12-09 10:48:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 287. [2018-12-09 10:48:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-09 10:48:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 374 transitions. [2018-12-09 10:48:29,856 INFO L728 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-12-09 10:48:29,856 INFO L608 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-12-09 10:48:29,856 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 10:48:29,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 374 transitions. [2018-12-09 10:48:29,857 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-12-09 10:48:29,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:29,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:29,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:29,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:48:29,857 INFO L794 eck$LassoCheckResult]: Stem: 8156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8154#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8131#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8132#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8140#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8151#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8152#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8155#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8177#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8178#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8196#L545-3 assume !(lis_~i~0 < lis_~N); 8158#L545-4 lis_~i~0 := 1; 8159#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8277#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8276#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8273#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8271#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8272#L548-3 assume !(lis_~j~0 < lis_~i~0); 8267#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8148#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8149#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8412#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8307#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8137#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8138#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8141#L549 assume !lis_#t~short11; 8161#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 8296#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8297#L548-3 assume !(lis_~j~0 < lis_~i~0); 8402#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8163#L547-3 assume !(lis_~i~0 < lis_~N); 8153#L547-4 lis_~i~0 := 0; 8129#L551-3 [2018-12-09 10:48:29,857 INFO L796 eck$LassoCheckResult]: Loop: 8129#L551-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 8130#L552 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 8157#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 8129#L551-3 [2018-12-09 10:48:29,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 837404217, now seen corresponding path program 1 times [2018-12-09 10:48:29,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,879 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 2 times [2018-12-09 10:48:29,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:29,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1939041103, now seen corresponding path program 1 times [2018-12-09 10:48:29,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:29,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:34,076 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 333 DAG size of output: 233 [2018-12-09 10:48:35,707 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 160 [2018-12-09 10:48:35,710 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:48:35,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:48:35,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:48:35,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:48:35,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:48:35,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:48:35,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:48:35,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:48:35,710 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration17_Lasso [2018-12-09 10:48:35,710 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:48:35,710 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:48:35,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,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-12-09 10:48:35,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,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-12-09 10:48:35,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-12-09 10:48:35,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:35,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:37,116 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 99 [2018-12-09 10:48:37,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:37,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:37,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:48:37,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:48:37,458 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-12-09 10:48:37,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,459 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-12-09 10:48:37,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,460 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-12-09 10:48:37,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,461 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-12-09 10:48:37,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,462 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-12-09 10:48:37,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,463 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-12-09 10:48:37,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,464 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-12-09 10:48:37,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,465 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-12-09 10:48:37,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,466 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-12-09 10:48:37,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,466 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-12-09 10:48:37,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,467 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-12-09 10:48:37,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,468 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-12-09 10:48:37,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,469 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-12-09 10:48:37,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,470 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-12-09 10:48:37,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,471 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-12-09 10:48:37,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,472 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-12-09 10:48:37,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,473 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-12-09 10:48:37,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,474 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-12-09 10:48:37,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,475 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-12-09 10:48:37,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:37,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:37,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:37,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,476 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-12-09 10:48:37,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,478 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-12-09 10:48:37,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,479 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-12-09 10:48:37,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,481 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-12-09 10:48:37,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,481 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:48:37,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,482 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:48:37,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,483 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-12-09 10:48:37,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,485 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-12-09 10:48:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:37,486 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-12-09 10:48:37,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:37,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:37,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:37,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:37,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:37,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:37,495 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:48:37,503 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:48:37,503 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 10:48:37,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:48:37,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:48:37,504 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:48:37,504 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-12-09 10:48:37,618 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-09 10:48:37,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:37,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:37,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:37,650 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-12-09 10:48:37,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96 Second operand 3 states. [2018-12-09 10:48:37,656 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96. Second operand 3 states. Result 290 states and 379 transitions. Complement of second has 4 states. [2018-12-09 10:48:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 10:48:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:48:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-12-09 10:48:37,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2018-12-09 10:48:37,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:37,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2018-12-09 10:48:37,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:37,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2018-12-09 10:48:37,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:37,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 379 transitions. [2018-12-09 10:48:37,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-12-09 10:48:37,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 233 states and 294 transitions. [2018-12-09 10:48:37,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-12-09 10:48:37,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-12-09 10:48:37,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 294 transitions. [2018-12-09 10:48:37,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:37,659 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 294 transitions. [2018-12-09 10:48:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 294 transitions. [2018-12-09 10:48:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2018-12-09 10:48:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-09 10:48:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 259 transitions. [2018-12-09 10:48:37,661 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-12-09 10:48:37,661 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-12-09 10:48:37,661 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-09 10:48:37,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 259 transitions. [2018-12-09 10:48:37,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-12-09 10:48:37,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:37,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:37,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:37,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-09 10:48:37,662 INFO L794 eck$LassoCheckResult]: Stem: 9014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9011#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8991#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8992#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8999#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9012#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9013#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9009#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9010#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9026#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9025#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9023#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9024#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9021#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9020#L545-3 assume !(lis_~i~0 < lis_~N); 9022#L545-4 lis_~i~0 := 1; 9038#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9037#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9035#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9034#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9033#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9032#L548-3 assume !(lis_~j~0 < lis_~i~0); 9027#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9084#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9081#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9082#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9117#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9116#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9113#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9107#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 9106#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9097#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-12-09 10:48:37,662 INFO L796 eck$LassoCheckResult]: Loop: 9096#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9095#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9094#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9092#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9093#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9102#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9105#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9103#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9100#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9098#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9099#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-12-09 10:48:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1848019324, now seen corresponding path program 2 times [2018-12-09 10:48:37,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:48:38,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:38,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:38,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:48:38,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:48:38,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:48:38,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:38,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 10:48:38,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 10:48:38,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-12-09 10:48:38,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2018-12-09 10:48:38,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 40 [2018-12-09 10:48:38,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 10:48:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:38,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-12-09 10:48:38,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2018-12-09 10:48:38,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,280 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:38,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,283 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:38,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 120 [2018-12-09 10:48:38,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-12-09 10:48:38,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:38,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-09 10:48:38,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:38,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 10:48:38,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:74 [2018-12-09 10:48:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 10:48:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2018-12-09 10:48:38,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:38,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 7 times [2018-12-09 10:48:38,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:38,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:38,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:38,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:38,736 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-12-09 10:48:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 10:48:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-12-09 10:48:38,807 INFO L87 Difference]: Start difference. First operand 206 states and 259 transitions. cyclomatic complexity: 61 Second operand 27 states. [2018-12-09 10:48:40,146 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-12-09 10:48:40,623 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-09 10:48:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:41,761 INFO L93 Difference]: Finished difference Result 417 states and 528 transitions. [2018-12-09 10:48:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-09 10:48:41,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 528 transitions. [2018-12-09 10:48:41,763 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 103 [2018-12-09 10:48:41,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 413 states and 524 transitions. [2018-12-09 10:48:41,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2018-12-09 10:48:41,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2018-12-09 10:48:41,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 524 transitions. [2018-12-09 10:48:41,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:41,765 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 524 transitions. [2018-12-09 10:48:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 524 transitions. [2018-12-09 10:48:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 311. [2018-12-09 10:48:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-09 10:48:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 403 transitions. [2018-12-09 10:48:41,771 INFO L728 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-12-09 10:48:41,771 INFO L608 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-12-09 10:48:41,771 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-09 10:48:41,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 403 transitions. [2018-12-09 10:48:41,772 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 82 [2018-12-09 10:48:41,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:41,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:41,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:41,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-09 10:48:41,772 INFO L794 eck$LassoCheckResult]: Stem: 9842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9839#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 9816#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9817#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 9825#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9840#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9841#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9837#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9838#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9853#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9852#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9850#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9851#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9848#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9847#L545-3 assume !(lis_~i~0 < lis_~N); 9849#L545-4 lis_~i~0 := 1; 9863#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9862#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9860#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9859#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9858#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9857#L548-3 assume !(lis_~j~0 < lis_~i~0); 9854#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9856#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9971#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9969#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9970#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10064#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10063#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10062#L549 assume !lis_#t~short11; 10061#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 10060#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10014#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-12-09 10:48:41,773 INFO L796 eck$LassoCheckResult]: Loop: 10015#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10007#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10008#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10003#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10000#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10001#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9996#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9997#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9990#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9991#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10057#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-12-09 10:48:41,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1848078906, now seen corresponding path program 6 times [2018-12-09 10:48:41,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:41,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 8 times [2018-12-09 10:48:41,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:41,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:41,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:41,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:41,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -339256426, now seen corresponding path program 7 times [2018-12-09 10:48:41,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:41,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 10:48:41,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:41,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:41,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:41,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 10:48:41,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:41,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-12-09 10:48:42,288 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-12-09 10:48:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 10:48:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:48:42,368 INFO L87 Difference]: Start difference. First operand 311 states and 403 transitions. cyclomatic complexity: 102 Second operand 17 states. [2018-12-09 10:48:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:42,578 INFO L93 Difference]: Finished difference Result 359 states and 456 transitions. [2018-12-09 10:48:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:48:42,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 456 transitions. [2018-12-09 10:48:42,580 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 127 [2018-12-09 10:48:42,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 309 states and 394 transitions. [2018-12-09 10:48:42,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-12-09 10:48:42,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2018-12-09 10:48:42,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 394 transitions. [2018-12-09 10:48:42,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:42,583 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 394 transitions. [2018-12-09 10:48:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 394 transitions. [2018-12-09 10:48:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 183. [2018-12-09 10:48:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 10:48:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2018-12-09 10:48:42,588 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-12-09 10:48:42,588 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-12-09 10:48:42,588 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-09 10:48:42,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 223 transitions. [2018-12-09 10:48:42,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 66 [2018-12-09 10:48:42,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:42,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:42,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:42,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-12-09 10:48:42,591 INFO L794 eck$LassoCheckResult]: Stem: 10673#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10670#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10657#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10658#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10662#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10671#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10672#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10668#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10669#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10683#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10682#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10680#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10681#L545-3 assume !(lis_~i~0 < lis_~N); 10674#L545-4 lis_~i~0 := 1; 10675#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10715#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10716#L549 assume !lis_#t~short11; 10710#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 10709#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10708#L548-3 assume !(lis_~j~0 < lis_~i~0); 10707#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10706#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10705#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10703#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10704#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10750#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10748#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10743#L549 assume !lis_#t~short11; 10744#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 10802#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10684#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-12-09 10:48:42,591 INFO L796 eck$LassoCheckResult]: Loop: 10664#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10665#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10800#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10799#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10797#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10795#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10792#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10790#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10789#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10788#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10736#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10786#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10772#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10735#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-12-09 10:48:42,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2081786852, now seen corresponding path program 8 times [2018-12-09 10:48:42,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:42,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:48:42,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:42,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:48:43,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:48:43,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:48:43,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:48:43,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:43,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 10:48:43,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 10:48:43,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-09 10:48:43,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-09 10:48:43,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:48:43,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-12-09 10:48:43,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-09 10:48:43,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:43 [2018-12-09 10:48:43,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-12-09 10:48:43,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,173 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-12-09 10:48:43,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-12-09 10:48:43,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,204 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-09 10:48:43,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2018-12-09 10:48:43,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 79 [2018-12-09 10:48:43,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,308 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 89 [2018-12-09 10:48:43,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-12-09 10:48:43,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,351 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-12-09 10:48:43,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:92, output treesize:75 [2018-12-09 10:48:43,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2018-12-09 10:48:43,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,476 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 112 [2018-12-09 10:48:43,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 85 [2018-12-09 10:48:43,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:43,533 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 184 [2018-12-09 10:48:43,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:48:43,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:43,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:86 [2018-12-09 10:48:44,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 175 [2018-12-09 10:48:44,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:44,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,174 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:44,207 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 80 treesize of output 169 [2018-12-09 10:48:44,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-12-09 10:48:44,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 185 [2018-12-09 10:48:44,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,456 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:44,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,481 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-12-09 10:48:44,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 186 [2018-12-09 10:48:44,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,627 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:44,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,669 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-12-09 10:48:44,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,776 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 202 [2018-12-09 10:48:44,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:44,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,858 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-12-09 10:48:44,859 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:44,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:44,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 195 [2018-12-09 10:48:45,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,017 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:45,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,056 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 209 [2018-12-09 10:48:45,057 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,196 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 169 [2018-12-09 10:48:45,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,211 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:45,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,239 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 179 [2018-12-09 10:48:45,240 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,336 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 196 [2018-12-09 10:48:45,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,361 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:45,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,395 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 205 [2018-12-09 10:48:45,398 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,516 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 203 [2018-12-09 10:48:45,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,537 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:48:45,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:48:45,577 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-12-09 10:48:45,579 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:45,703 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 10:48:46,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 65 dim-0 vars, and 21 xjuncts. [2018-12-09 10:48:47,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 107 dim-0 vars, and 21 xjuncts. [2018-12-09 10:48:47,356 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:149, output treesize:3651 [2018-12-09 10:48:51,975 WARN L180 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 975 DAG size of output: 67 [2018-12-09 10:48:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:52,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:52,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2018-12-09 10:48:52,062 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:52,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -304943832, now seen corresponding path program 9 times [2018-12-09 10:48:52,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:52,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:52,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:52,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:52,995 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-12-09 10:48:53,197 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 10:48:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 10:48:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 10:48:53,198 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. cyclomatic complexity: 45 Second operand 37 states. [2018-12-09 10:48:54,986 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-12-09 10:48:55,898 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-09 10:48:57,131 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-09 10:48:59,424 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-12-09 10:48:59,724 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-12-09 10:49:00,244 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-09 10:49:01,877 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-09 10:49:02,182 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-12-09 10:49:02,522 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-12-09 10:49:02,901 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-12-09 10:49:03,246 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-12-09 10:49:03,511 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-12-09 10:49:03,801 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-12-09 10:49:03,985 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-09 10:49:04,281 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2018-12-09 10:49:04,529 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-12-09 10:49:04,743 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2018-12-09 10:49:05,227 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-12-09 10:49:05,473 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-12-09 10:49:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:49:05,486 INFO L93 Difference]: Finished difference Result 408 states and 524 transitions. [2018-12-09 10:49:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-09 10:49:05,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 524 transitions. [2018-12-09 10:49:05,488 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 234 [2018-12-09 10:49:05,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 524 transitions. [2018-12-09 10:49:05,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 395 [2018-12-09 10:49:05,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2018-12-09 10:49:05,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 524 transitions. [2018-12-09 10:49:05,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:49:05,491 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 524 transitions. [2018-12-09 10:49:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 524 transitions. [2018-12-09 10:49:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 204. [2018-12-09 10:49:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-09 10:49:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 247 transitions. [2018-12-09 10:49:05,499 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-12-09 10:49:05,499 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-12-09 10:49:05,499 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-09 10:49:05,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 247 transitions. [2018-12-09 10:49:05,500 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 70 [2018-12-09 10:49:05,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:49:05,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:49:05,501 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:49:05,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 10:49:05,501 INFO L794 eck$LassoCheckResult]: Stem: 11577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11573#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11560#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11561#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 11565#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11574#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11584#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11582#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11583#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11585#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11575#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11576#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11711#L545-3 assume !(lis_~i~0 < lis_~N); 11578#L545-4 lis_~i~0 := 1; 11579#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11597#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11598#L549 assume !lis_#t~short11; 11631#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 11630#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11629#L548-3 assume !(lis_~j~0 < lis_~i~0); 11628#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11627#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11626#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11624#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11625#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11660#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11657#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11591#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 11590#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11586#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-12-09 10:49:05,501 INFO L796 eck$LassoCheckResult]: Loop: 11567#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11568#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11745#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11744#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11742#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11741#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11740#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11728#L549 assume !lis_#t~short11; 11687#L549-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11; 11686#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11723#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11680#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11721#L549-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11682#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11679#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-12-09 10:49:05,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:49:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2081846434, now seen corresponding path program 9 times [2018-12-09 10:49:05,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:49:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:49:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:49:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:49:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:49:05,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:49:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 660716904, now seen corresponding path program 4 times [2018-12-09 10:49:05,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:49:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:49:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:49:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:49:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:49:05,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:49:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1506700395, now seen corresponding path program 10 times [2018-12-09 10:49:05,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:49:05,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:49:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:49:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:49:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:49:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:49:06,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:49:06,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed0a865b-c08d-428c-badf-e8fa77097913/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:49:06,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 10:49:06,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 10:49:06,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:49:06,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:49:06,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:06,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 10:49:06,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:06,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:06,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 10:49:06,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:06,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:06,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:06,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 10:49:07,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2018-12-09 10:49:07,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-12-09 10:49:07,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 10:49:07,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-12-09 10:49:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:49:07,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-12-09 10:49:07,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:49:07,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:49:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 10:49:07,261 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:85, output treesize:93 [2018-12-09 10:49:07,605 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-09 10:49:07,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2018-12-09 10:49:07,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 147 [2018-12-09 10:49:07,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 10:49:07,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 109 [2018-12-09 10:49:07,789 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:49:07,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-12-09 10:49:07,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 107 [2018-12-09 10:49:07,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 56 [2018-12-09 10:49:07,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 10:49:07,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 115 [2018-12-09 10:49:07,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:07,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 75 [2018-12-09 10:49:07,852 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:49:07,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:49:08,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2018-12-09 10:49:08,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:08,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:49:08,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-12-09 10:49:08,006 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:49:08,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2018-12-09 10:49:08,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-12-09 10:49:08,037 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 10:49:08,051 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:49:08,072 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:49:08,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 4 xjuncts. [2018-12-09 10:49:08,138 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:259, output treesize:388 [2018-12-09 10:49:20,563 WARN L180 SmtUtils]: Spent 12.35 s on a formula simplification. DAG size of input: 141 DAG size of output: 46 [2018-12-09 10:49:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 58 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 10:49:20,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:49:20,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-12-09 10:49:21,050 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-12-09 10:49:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 10:49:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 10:49:21,140 INFO L87 Difference]: Start difference. First operand 204 states and 247 transitions. cyclomatic complexity: 49 Second operand 34 states. [2018-12-09 10:49:45,428 WARN L180 SmtUtils]: Spent 24.20 s on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-12-09 10:49:57,531 WARN L180 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-12-09 10:49:58,851 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-12-09 10:50:00,155 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-12-09 10:50:00,333 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-12-09 10:50:00,641 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2018-12-09 10:50:00,894 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-09 10:50:01,352 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-12-09 10:50:01,519 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-12-09 10:50:01,903 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-09 10:50:02,174 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2018-12-09 10:50:02,541 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2018-12-09 10:50:02,893 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-12-09 10:50:03,197 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-12-09 10:50:03,523 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-12-09 10:50:04,078 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 101 [2018-12-09 10:50:04,431 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2018-12-09 10:50:04,768 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2018-12-09 10:50:05,021 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 97 [2018-12-09 10:50:05,546 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2018-12-09 10:50:05,963 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2018-12-09 10:50:06,362 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 89 [2018-12-09 10:50:06,616 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-12-09 10:50:06,922 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2018-12-09 10:50:07,162 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-12-09 10:50:07,384 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2018-12-09 10:50:07,729 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 117 [2018-12-09 10:50:08,078 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2018-12-09 10:50:08,430 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2018-12-09 10:50:08,712 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 118 [2018-12-09 10:50:09,106 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2018-12-09 10:50:09,469 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-12-09 10:50:09,884 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2018-12-09 10:50:10,181 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2018-12-09 10:50:10,403 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-12-09 10:50:10,783 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-12-09 10:50:17,374 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-12-09 10:50:17,375 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:65) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 38 more [2018-12-09 10:50:17,377 INFO L168 Benchmark]: Toolchain (without parser) took 146981.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:17,377 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:50:17,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:17,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 1.1 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-12-09 10:50:17,377 INFO L168 Benchmark]: Boogie Preprocessor took 15.70 ms. Allocated memory is still 1.1 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-12-09 10:50:17,378 INFO L168 Benchmark]: RCFGBuilder took 174.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:17,378 INFO L168 Benchmark]: BuchiAutomizer took 146484.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:17,379 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 15.70 ms. Allocated memory is still 1.1 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 174.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 146484.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...