./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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 111460b358d4c09612932eb239746dbb8202adb9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:15:23,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:15:23,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:15:23,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:15:23,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:15:23,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:15:23,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:15:23,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:15:23,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:15:23,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:15:23,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:15:23,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:15:23,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:15:23,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:15:23,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:15:23,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:15:23,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:15:23,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:15:23,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:15:23,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:15:23,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:15:23,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:15:23,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:15:23,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:15:23,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:15:23,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:15:23,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:15:23,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:15:23,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:15:23,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:15:23,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:15:23,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:15:23,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:15:23,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:15:23,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:15:23,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:15:23,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:15:23,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:15:23,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:15:23,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:15:23,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:15:23,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:15:23,959 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:15:23,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:15:23,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:15:23,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:15:23,962 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:15:23,963 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:15:23,963 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:15:23,963 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:15:23,963 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:15:23,964 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:15:23,965 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:15:23,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:15:23,966 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:15:23,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:15:23,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:15:23,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:15:23,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:15:23,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:15:23,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:15:23,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:15:23,968 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:15:23,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:15:23,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:15:23,969 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:15:23,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:15:23,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:15:23,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:15:23,970 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:15:23,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:15:23,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:15:23,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:15:23,973 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:15:23,974 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:15:23,975 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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 -> 111460b358d4c09612932eb239746dbb8202adb9 [2020-11-29 19:15:24,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:15:24,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:15:24,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:15:24,314 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:15:24,315 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:15:24,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-11-29 19:15:24,397 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/data/06eef93d2/b1b56367d5824f09ae75e292f87fe926/FLAG06c2307e1 [2020-11-29 19:15:25,136 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:15:25,136 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-11-29 19:15:25,155 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/data/06eef93d2/b1b56367d5824f09ae75e292f87fe926/FLAG06c2307e1 [2020-11-29 19:15:25,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/data/06eef93d2/b1b56367d5824f09ae75e292f87fe926 [2020-11-29 19:15:25,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:15:25,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:15:25,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:15:25,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:15:25,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:15:25,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:15:25" (1/1) ... [2020-11-29 19:15:25,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a9885d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:25, skipping insertion in model container [2020-11-29 19:15:25,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:15:25" (1/1) ... [2020-11-29 19:15:25,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:15:25,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:15:25,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:15:25,884 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:15:25,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:15:26,047 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:15:26,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26 WrapperNode [2020-11-29 19:15:26,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:15:26,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:15:26,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:15:26,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:15:26,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:15:26,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:15:26,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:15:26,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:15:26,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... [2020-11-29 19:15:26,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:15:26,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:15:26,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:15:26,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:15:26,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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 [2020-11-29 19:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:15:26,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:15:26,874 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:15:26,874 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-11-29 19:15:26,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:15:26 BoogieIcfgContainer [2020-11-29 19:15:26,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:15:26,877 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:15:26,877 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:15:26,880 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:15:26,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:15:26,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:15:25" (1/3) ... [2020-11-29 19:15:26,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637be84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:15:26, skipping insertion in model container [2020-11-29 19:15:26,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:15:26,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:15:26" (2/3) ... [2020-11-29 19:15:26,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637be84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:15:26, skipping insertion in model container [2020-11-29 19:15:26,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:15:26,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:15:26" (3/3) ... [2020-11-29 19:15:26,886 INFO L373 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-11-29 19:15:26,951 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:15:26,952 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:15:26,952 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:15:26,952 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:15:26,952 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:15:26,952 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:15:26,953 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:15:26,953 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:15:26,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-11-29 19:15:27,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-11-29 19:15:27,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:27,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:27,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 19:15:27,009 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:15:27,009 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:15:27,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-11-29 19:15:27,012 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-11-29 19:15:27,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:27,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:27,013 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 19:15:27,013 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:15:27,022 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 23#L535-3true [2020-11-29 19:15:27,022 INFO L796 eck$LassoCheckResult]: Loop: 23#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 10#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 23#L535-3true [2020-11-29 19:15:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-29 19:15:27,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:27,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494021555] [2020-11-29 19:15:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-29 19:15:27,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:27,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571740711] [2020-11-29 19:15:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,205 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-29 19:15:27,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:27,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362746153] [2020-11-29 19:15:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:27,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:27,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:27,549 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-29 19:15:27,643 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:15:27,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:15:27,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:15:27,647 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:15:27,647 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:15:27,647 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:27,647 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:15:27,647 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:15:27,647 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-11-29 19:15:27,648 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:15:27,648 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:15:27,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:27,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:27,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:27,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:27,923 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-29 19:15:28,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:28,468 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:15:28,473 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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 [2020-11-29 19:15:28,478 INFO L120 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 [2020-11-29 19:15:28,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:28,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:28,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:28,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:28,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:28,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:28,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:28,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/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 [2020-11-29 19:15:28,530 INFO L120 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 [2020-11-29 19:15:28,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:28,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:28,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:28,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:28,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:28,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:28,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:28,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:28,580 INFO L120 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 [2020-11-29 19:15:28,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:28,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:28,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:28,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:28,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:28,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:28,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:28,629 INFO L120 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 [2020-11-29 19:15:28,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:28,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:28,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:28,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:28,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:28,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:28,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:28,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:28,667 INFO L120 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 [2020-11-29 19:15:28,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:28,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:28,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:28,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:28,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:28,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:28,706 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:15:28,812 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-29 19:15:28,812 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:28,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:28,833 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-29 19:15:28,833 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:15:28,834 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -4*ULTIMATE.start_main_~i~1 + 2147483637 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 + 1*ULTIMATE.start_main_~numbers~0.offset + 2147483640 >= 0] [2020-11-29 19:15:28,887 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-11-29 19:15:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:28,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:15:28,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:29,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 19:15:29,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:15:29,088 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-29 19:15:29,089 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2020-11-29 19:15:29,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 47 states and 74 transitions. Complement of second has 9 states. [2020-11-29 19:15:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:15:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-29 19:15:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-11-29 19:15:29,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 19:15:29,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:29,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-29 19:15:29,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:29,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-29 19:15:29,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:29,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2020-11-29 19:15:29,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-29 19:15:29,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2020-11-29 19:15:29,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-29 19:15:29,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-29 19:15:29,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-11-29 19:15:29,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:15:29,232 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-11-29 19:15:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-11-29 19:15:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-29 19:15:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 19:15:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-11-29 19:15:29,263 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-11-29 19:15:29,263 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-11-29 19:15:29,263 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:15:29,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-11-29 19:15:29,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-29 19:15:29,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:29,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:29,267 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 19:15:29,267 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:15:29,268 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 156#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 160#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 153#L535-3 assume !(main_~i~1 < main_~array_size~0); 154#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 146#L517-3 [2020-11-29 19:15:29,268 INFO L796 eck$LassoCheckResult]: Loop: 146#L517-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); 145#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 146#L517-3 [2020-11-29 19:15:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-29 19:15:29,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:29,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072555985] [2020-11-29 19:15:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:15:29,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072555985] [2020-11-29 19:15:29,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:15:29,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:15:29,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698064924] [2020-11-29 19:15:29,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:15:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-11-29 19:15:29,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:29,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251325009] [2020-11-29 19:15:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,424 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:29,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:15:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:15:29,553 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-11-29 19:15:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:29,586 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-11-29 19:15:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:15:29,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-11-29 19:15:29,588 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-29 19:15:29,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-11-29 19:15:29,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 19:15:29,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-29 19:15:29,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-11-29 19:15:29,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:15:29,589 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-11-29 19:15:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-11-29 19:15:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-29 19:15:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 19:15:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-11-29 19:15:29,592 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-11-29 19:15:29,592 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-11-29 19:15:29,592 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:15:29,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-11-29 19:15:29,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-29 19:15:29,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:29,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:29,593 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:29,594 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:15:29,594 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 203#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 204#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 210#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 205#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 201#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 202#L535-3 assume !(main_~i~1 < main_~array_size~0); 206#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 196#L517-3 [2020-11-29 19:15:29,594 INFO L796 eck$LassoCheckResult]: Loop: 196#L517-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); 195#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 196#L517-3 [2020-11-29 19:15:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-11-29 19:15:29,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:29,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210087454] [2020-11-29 19:15:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-11-29 19:15:29,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:29,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893368480] [2020-11-29 19:15:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,691 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-11-29 19:15:29,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:29,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970566929] [2020-11-29 19:15:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:29,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:29,748 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:30,371 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2020-11-29 19:15:30,573 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-29 19:15:30,577 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:15:30,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:15:30,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:15:30,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:15:30,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:15:30,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:30,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:15:30,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:15:30,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-11-29 19:15:30,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:15:30,578 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:15:30,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:30,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,066 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-11-29 19:15:31,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:31,599 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-11-29 19:15:31,961 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 19:15:32,192 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:15:32,192 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,205 INFO L120 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 [2020-11-29 19:15:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:32,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:32,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,236 INFO L120 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 [2020-11-29 19:15:32,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:32,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:32,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,273 INFO L120 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 [2020-11-29 19:15:32,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:32,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:32,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:32,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,306 INFO L120 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 [2020-11-29 19:15:32,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:32,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:32,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:32,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,335 INFO L120 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 [2020-11-29 19:15:32,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:32,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:32,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,412 INFO L120 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 [2020-11-29 19:15:32,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:32,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:32,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:32,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,445 INFO L120 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 [2020-11-29 19:15:32,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:32,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:32,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:15:32,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,479 INFO L120 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 [2020-11-29 19:15:32,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:32,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:32,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:32,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:32,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:32,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:32,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:15:32,625 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-11-29 19:15:32,625 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:32,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:15:32,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:15:32,667 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:15:32,667 INFO L512 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 [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:32,799 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-11-29 19:15:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:32,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:15:32,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:15:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:15:32,891 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 [2020-11-29 19:15:32,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-11-29 19:15:32,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 7 states. [2020-11-29 19:15:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:15:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:15:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-11-29 19:15:32,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-11-29 19:15:32,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:32,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-11-29 19:15:32,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:32,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-11-29 19:15:32,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:32,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-11-29 19:15:32,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-11-29 19:15:32,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-11-29 19:15:32,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 19:15:32,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-29 19:15:32,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-11-29 19:15:32,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:15:32,926 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-11-29 19:15:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-11-29 19:15:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-29 19:15:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-29 19:15:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-11-29 19:15:32,932 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-11-29 19:15:32,933 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-11-29 19:15:32,933 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:15:32,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-11-29 19:15:32,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-11-29 19:15:32,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:32,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:32,937 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:32,937 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:15:32,938 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 375#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 376#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 382#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 377#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 373#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 374#L535-3 assume !(main_~i~1 < main_~array_size~0); 378#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 369#L517-3 assume !(lis_~i~0 < lis_~N); 370#L517-4 lis_~i~0 := 1; 363#L519-3 [2020-11-29 19:15:32,940 INFO L796 eck$LassoCheckResult]: Loop: 363#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 365#L520-3 assume !(lis_~j~0 < lis_~i~0); 384#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 363#L519-3 [2020-11-29 19:15:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-11-29 19:15:32,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:32,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405331278] [2020-11-29 19:15:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 19:15:33,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405331278] [2020-11-29 19:15:33,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:15:33,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:15:33,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275837190] [2020-11-29 19:15:33,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:15:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-11-29 19:15:33,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:33,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507236476] [2020-11-29 19:15:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:33,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:33,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:33,070 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:33,115 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:15:33,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:15:33,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:15:33,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:15:33,116 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 19:15:33,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:15:33,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:15:33,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-11-29 19:15:33,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:15:33,117 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:15:33,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,244 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:15:33,245 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:33,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 19:15:33,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 19:15:33,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 19:15:33,258 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 19:15:33,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 19:15:33,290 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 19:15:33,290 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 19:15:33,318 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:33,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 19:15:33,375 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,573 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 19:15:33,575 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:15:33,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:15:33,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:15:33,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:15:33,575 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:15:33,575 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:15:33,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:15:33,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-11-29 19:15:33,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:15:33,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:15:33,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:33,670 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:15:33,670 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,674 INFO L120 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 [2020-11-29 19:15:33,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:33,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:33,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:33,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:33,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:33,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:15:33,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:33,741 INFO L120 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 [2020-11-29 19:15:33,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:33,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:33,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:33,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:33,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:15:33,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:15:33,798 INFO L120 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 [2020-11-29 19:15:33,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:15:33,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:15:33,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:15:33,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:15:33,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:15:33,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:15:33,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:15:33,814 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-29 19:15:33,815 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:33,818 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:15:33,818 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 19:15:33,818 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:15:33,818 INFO L512 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 [] [2020-11-29 19:15:33,843 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 19:15:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:33,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:15:33,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:33,911 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:15:33,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:15:33,925 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 [2020-11-29 19:15:33,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-11-29 19:15:33,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 46 transitions. Complement of second has 7 states. [2020-11-29 19:15:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:15:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:15:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-11-29 19:15:33,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2020-11-29 19:15:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 3 letters. [2020-11-29 19:15:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2020-11-29 19:15:33,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:15:33,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2020-11-29 19:15:33,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:33,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 42 transitions. [2020-11-29 19:15:33,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 19:15:33,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-29 19:15:33,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-11-29 19:15:33,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:33,978 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-11-29 19:15:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-11-29 19:15:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-11-29 19:15:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 19:15:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-11-29 19:15:33,981 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-11-29 19:15:33,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:15:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:15:33,982 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-11-29 19:15:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:34,064 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-11-29 19:15:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:15:34,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-11-29 19:15:34,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:34,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 41 transitions. [2020-11-29 19:15:34,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 19:15:34,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 19:15:34,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-11-29 19:15:34,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:34,066 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-11-29 19:15:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-11-29 19:15:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-11-29 19:15:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 19:15:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-11-29 19:15:34,098 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-11-29 19:15:34,098 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-11-29 19:15:34,098 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:15:34,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-11-29 19:15:34,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:34,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:34,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:34,100 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:34,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:15:34,101 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 549#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 550#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 558#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 551#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 547#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 548#L535-3 assume !(main_~i~1 < main_~array_size~0); 552#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 543#L517-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); 540#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 541#L517-3 assume !(lis_~i~0 < lis_~N); 544#L517-4 lis_~i~0 := 1; 535#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 538#L520-3 [2020-11-29 19:15:34,101 INFO L796 eck$LassoCheckResult]: Loop: 538#L520-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; 553#L521 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; 554#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8; 559#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 538#L520-3 [2020-11-29 19:15:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-11-29 19:15:34,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:34,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240130863] [2020-11-29 19:15:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 19:15:34,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240130863] [2020-11-29 19:15:34,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864293534] [2020-11-29 19:15:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:15:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:34,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:15:34,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 19:15:34,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:15:34,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-11-29 19:15:34,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786535988] [2020-11-29 19:15:34,355 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:15:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-11-29 19:15:34,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:34,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653216783] [2020-11-29 19:15:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:34,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:34,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:34,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:34,543 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-29 19:15:34,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:15:34,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:15:34,597 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-11-29 19:15:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:35,048 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2020-11-29 19:15:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:15:35,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2020-11-29 19:15:35,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-29 19:15:35,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 66 transitions. [2020-11-29 19:15:35,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-11-29 19:15:35,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-11-29 19:15:35,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2020-11-29 19:15:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:35,053 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2020-11-29 19:15:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2020-11-29 19:15:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-11-29 19:15:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:15:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-11-29 19:15:35,056 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-11-29 19:15:35,056 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-11-29 19:15:35,056 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:15:35,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-11-29 19:15:35,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:35,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:35,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:35,058 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:35,058 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:15:35,061 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 711#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 720#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 712#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 708#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 709#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 713#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 724#L535-3 assume !(main_~i~1 < main_~array_size~0); 719#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 702#L517-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); 703#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 704#L517-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); 699#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 700#L517-3 assume !(lis_~i~0 < lis_~N); 707#L517-4 lis_~i~0 := 1; 694#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 696#L520-3 [2020-11-29 19:15:35,061 INFO L796 eck$LassoCheckResult]: Loop: 696#L520-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; 714#L521 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; 715#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8; 721#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 696#L520-3 [2020-11-29 19:15:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2020-11-29 19:15:35,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:35,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935186614] [2020-11-29 19:15:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:35,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:35,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:35,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2020-11-29 19:15:35,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:35,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648396712] [2020-11-29 19:15:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:35,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:35,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:35,223 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-11-29 19:15:35,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:35,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066471512] [2020-11-29 19:15:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 19:15:35,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066471512] [2020-11-29 19:15:35,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412091659] [2020-11-29 19:15:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:15:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:35,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-29 19:15:35,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:35,852 INFO L384 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 0 case distinctions, treesize of input 12 treesize of output 9 [2020-11-29 19:15:35,859 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:15:35,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:15:35,865 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:15:35,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-29 19:15:35,955 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:15:35,955 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-11-29 19:15:35,957 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:15:35,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:15:35,968 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:15:35,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2020-11-29 19:15:35,998 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 39 treesize of output 23 [2020-11-29 19:15:35,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:15:36,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:15:36,009 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:15:36,009 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-11-29 19:15:36,177 INFO L350 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-11-29 19:15:36,178 INFO L384 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 2 case distinctions, treesize of input 50 treesize of output 41 [2020-11-29 19:15:36,180 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:15:36,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:15:36,199 INFO L545 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. [2020-11-29 19:15:36,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2020-11-29 19:15:36,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:15:36,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:15:36,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:15:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:15:36,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:15:36,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-11-29 19:15:36,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597912926] [2020-11-29 19:15:36,719 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-29 19:15:36,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 19:15:36,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-11-29 19:15:36,762 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 17 states. [2020-11-29 19:15:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:37,660 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2020-11-29 19:15:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:15:37,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2020-11-29 19:15:37,663 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2020-11-29 19:15:37,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 98 transitions. [2020-11-29 19:15:37,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-29 19:15:37,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 19:15:37,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2020-11-29 19:15:37,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:37,666 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-11-29 19:15:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2020-11-29 19:15:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-11-29 19:15:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-29 19:15:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2020-11-29 19:15:37,679 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-11-29 19:15:37,679 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-11-29 19:15:37,679 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 19:15:37,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 56 transitions. [2020-11-29 19:15:37,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:37,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:37,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:37,683 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:37,683 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:15:37,683 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 911#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 912#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 922#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 913#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 909#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 910#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 914#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 928#L535-3 assume !(main_~i~1 < main_~array_size~0); 921#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 902#L517-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); 903#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 904#L517-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); 899#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 900#L517-3 assume !(lis_~i~0 < lis_~N); 907#L517-4 lis_~i~0 := 1; 908#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 933#L520-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; 934#L521 assume !lis_#t~short11; 916#L521-2 [2020-11-29 19:15:37,683 INFO L796 eck$LassoCheckResult]: Loop: 916#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8; 924#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 896#L520-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; 915#L521 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; 916#L521-2 [2020-11-29 19:15:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-11-29 19:15:37,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:37,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425206444] [2020-11-29 19:15:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:37,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:37,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:37,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 3 times [2020-11-29 19:15:37,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:37,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266781157] [2020-11-29 19:15:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:37,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:37,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:37,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-11-29 19:15:37,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:37,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610551408] [2020-11-29 19:15:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:15:37,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610551408] [2020-11-29 19:15:37,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711231859] [2020-11-29 19:15:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:15:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:38,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:15:38,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:15:38,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:15:38,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-11-29 19:15:38,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573706613] [2020-11-29 19:15:38,251 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-11-29 19:15:38,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:15:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:15:38,313 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-11-29 19:15:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:38,414 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-11-29 19:15:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:15:38,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-11-29 19:15:38,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:38,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 64 transitions. [2020-11-29 19:15:38,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-11-29 19:15:38,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-11-29 19:15:38,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-11-29 19:15:38,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:38,417 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-11-29 19:15:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-11-29 19:15:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-11-29 19:15:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-29 19:15:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-11-29 19:15:38,420 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-11-29 19:15:38,420 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-11-29 19:15:38,420 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 19:15:38,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-11-29 19:15:38,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:38,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:38,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:38,421 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:38,421 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:15:38,421 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1087#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1088#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1098#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1089#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1085#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1086#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1090#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1104#L535-3 assume !(main_~i~1 < main_~array_size~0); 1097#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1079#L517-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); 1076#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1077#L517-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); 1080#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1105#L517-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); 1106#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1110#L517-3 assume !(lis_~i~0 < lis_~N); 1109#L517-4 lis_~i~0 := 1; 1070#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1071#L520-3 assume !(lis_~j~0 < lis_~i~0); 1103#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1072#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1074#L520-3 [2020-11-29 19:15:38,421 INFO L796 eck$LassoCheckResult]: Loop: 1074#L520-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; 1091#L521 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; 1092#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8; 1099#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1074#L520-3 [2020-11-29 19:15:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:38,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1189567124, now seen corresponding path program 1 times [2020-11-29 19:15:38,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:38,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817538816] [2020-11-29 19:15:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 19:15:38,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817538816] [2020-11-29 19:15:38,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:15:38,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:15:38,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831982414] [2020-11-29 19:15:38,486 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:15:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 4 times [2020-11-29 19:15:38,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:38,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386394323] [2020-11-29 19:15:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:38,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:38,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:38,502 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:38,679 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-29 19:15:38,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:15:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:15:38,719 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-11-29 19:15:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:38,771 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-11-29 19:15:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:15:38,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2020-11-29 19:15:38,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:38,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 58 transitions. [2020-11-29 19:15:38,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 19:15:38,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-29 19:15:38,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 58 transitions. [2020-11-29 19:15:38,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:38,774 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-11-29 19:15:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 58 transitions. [2020-11-29 19:15:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-11-29 19:15:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-29 19:15:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-11-29 19:15:38,781 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-11-29 19:15:38,781 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-11-29 19:15:38,781 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 19:15:38,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-11-29 19:15:38,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:38,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:38,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:38,783 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:38,783 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:15:38,784 INFO L794 eck$LassoCheckResult]: Stem: 1189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1180#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1181#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1191#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1182#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1178#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1179#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1183#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1197#L535-3 assume !(main_~i~1 < main_~array_size~0); 1190#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1173#L517-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); 1174#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1206#L517-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); 1205#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1204#L517-3 assume !(lis_~i~0 < lis_~N); 1203#L517-4 lis_~i~0 := 1; 1200#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1195#L520-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; 1186#L521 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; 1187#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;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); 1193#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1194#L520-3 assume !(lis_~j~0 < lis_~i~0); 1196#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1166#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1168#L520-3 [2020-11-29 19:15:38,784 INFO L796 eck$LassoCheckResult]: Loop: 1168#L520-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; 1184#L521 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; 1185#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8; 1192#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L520-3 [2020-11-29 19:15:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash 500757827, now seen corresponding path program 1 times [2020-11-29 19:15:38,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:38,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030505069] [2020-11-29 19:15:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 19:15:38,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030505069] [2020-11-29 19:15:38,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592735850] [2020-11-29 19:15:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_005f5ebb-ee75-438f-a570-9948ee74314b/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:15:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:15:38,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:15:38,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:15:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 19:15:39,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:15:39,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-11-29 19:15:39,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219506930] [2020-11-29 19:15:39,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:15:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:39,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 5 times [2020-11-29 19:15:39,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:39,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141811027] [2020-11-29 19:15:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:39,230 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-29 19:15:39,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:15:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:15:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:15:39,274 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-11-29 19:15:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:15:39,493 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2020-11-29 19:15:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:15:39,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 93 transitions. [2020-11-29 19:15:39,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:15:39,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 93 transitions. [2020-11-29 19:15:39,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-29 19:15:39,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-11-29 19:15:39,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2020-11-29 19:15:39,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:15:39,497 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2020-11-29 19:15:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2020-11-29 19:15:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-11-29 19:15:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-29 19:15:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2020-11-29 19:15:39,502 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-11-29 19:15:39,502 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-11-29 19:15:39,502 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 19:15:39,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 87 transitions. [2020-11-29 19:15:39,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:15:39,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:15:39,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:15:39,504 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:15:39,505 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:15:39,505 INFO L794 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1390#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1391#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1401#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1392#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1393#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1430#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1429#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1428#L535-3 assume !(main_~i~1 < main_~array_size~0); 1427#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1426#L517-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); 1425#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1424#L517-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); 1423#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1422#L517-3 assume !(lis_~i~0 < lis_~N); 1419#L517-4 lis_~i~0 := 1; 1417#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1415#L520-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; 1413#L521 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; 1411#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;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); 1409#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1408#L520-3 assume !(lis_~j~0 < lis_~i~0); 1405#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1406#L519-3 assume !(lis_~i~0 < lis_~N); 1376#L519-4 lis_~i~0 := 0; 1381#L523-3 [2020-11-29 19:15:39,505 INFO L796 eck$LassoCheckResult]: Loop: 1381#L523-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); 1384#L524 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; 1385#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1381#L523-3 [2020-11-29 19:15:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2020-11-29 19:15:39,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:39,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142795750] [2020-11-29 19:15:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,565 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-11-29 19:15:39,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:39,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392309280] [2020-11-29 19:15:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,575 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:15:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2020-11-29 19:15:39,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:15:39,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383335448] [2020-11-29 19:15:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:15:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:15:39,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:15:39,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:15:45,055 WARN L193 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2020-11-29 19:15:47,181 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 148 [2020-11-29 19:15:47,184 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:15:47,184 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:15:47,184 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:15:47,184 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:15:47,184 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:15:47,184 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:15:47,185 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:15:47,185 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:15:47,185 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2020-11-29 19:15:47,185 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:15:47,185 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:15:47,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:47,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:15:48,691 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-29 19:15:48,694 INFO L168 Benchmark]: Toolchain (without parser) took 23293.58 ms. Allocated memory was 88.1 MB in the beginning and 218.1 MB in the end (delta: 130.0 MB). Free memory was 61.8 MB in the beginning and 167.5 MB in the end (delta: -105.7 MB). Peak memory consumption was 130.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,695 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 73.4 MB. Free memory was 42.9 MB in the beginning and 42.9 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:15:48,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.03 ms. Allocated memory is still 88.1 MB. Free memory was 61.7 MB in the beginning and 40.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.33 ms. Allocated memory is still 88.1 MB. Free memory was 40.7 MB in the beginning and 38.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,696 INFO L168 Benchmark]: Boogie Preprocessor took 64.97 ms. Allocated memory is still 88.1 MB. Free memory was 38.7 MB in the beginning and 37.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,696 INFO L168 Benchmark]: RCFGBuilder took 659.57 ms. Allocated memory is still 88.1 MB. Free memory was 37.2 MB in the beginning and 51.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,696 INFO L168 Benchmark]: BuchiAutomizer took 21816.63 ms. Allocated memory was 88.1 MB in the beginning and 218.1 MB in the end (delta: 130.0 MB). Free memory was 50.9 MB in the beginning and 167.5 MB in the end (delta: -116.6 MB). Peak memory consumption was 117.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:15:48,699 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 73.4 MB. Free memory was 42.9 MB in the beginning and 42.9 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 650.03 ms. Allocated memory is still 88.1 MB. Free memory was 61.7 MB in the beginning and 40.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.33 ms. Allocated memory is still 88.1 MB. Free memory was 40.7 MB in the beginning and 38.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.97 ms. Allocated memory is still 88.1 MB. Free memory was 38.7 MB in the beginning and 37.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 659.57 ms. Allocated memory is still 88.1 MB. Free memory was 37.2 MB in the beginning and 51.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 21816.63 ms. Allocated memory was 88.1 MB in the beginning and 218.1 MB in the end (delta: 130.0 MB). Free memory was 50.9 MB in the beginning and 167.5 MB in the end (delta: -116.6 MB). Peak memory consumption was 117.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...