./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 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-69874e2 [2020-12-01 15:20:51,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:20:51,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:20:51,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:20:51,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:20:51,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:20:51,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:20:51,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:20:51,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:20:51,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:20:51,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:20:51,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:20:51,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:20:51,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:20:51,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:20:51,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:20:51,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:20:51,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:20:51,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:20:51,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:20:51,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:20:51,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:20:51,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:20:51,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:20:51,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:20:51,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:20:51,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:20:51,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:20:51,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:20:51,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:20:51,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:20:51,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:20:51,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:20:51,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:20:51,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:20:51,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:20:51,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:20:51,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:20:51,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:20:51,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:20:51,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:20:51,849 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-12-01 15:20:51,879 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:20:51,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:20:51,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:20:51,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:20:51,881 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:20:51,882 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-12-01 15:20:51,882 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-12-01 15:20:51,882 INFO L138 SettingsManager]: * Use old map elimination=false [2020-12-01 15:20:51,882 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-12-01 15:20:51,883 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-12-01 15:20:51,883 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-12-01 15:20:51,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:20:51,884 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:20:51,884 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-01 15:20:51,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:20:51,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:20:51,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:20:51,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-12-01 15:20:51,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-12-01 15:20:51,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-12-01 15:20:51,886 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:20:51,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:20:51,886 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-12-01 15:20:51,886 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:20:51,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-12-01 15:20:51,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:20:51,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:20:51,888 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-12-01 15:20:51,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:20:51,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:20:51,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:20:51,889 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-12-01 15:20:51,890 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-12-01 15:20:51,890 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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:52,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:20:52,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:20:52,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:20:52,230 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:20:52,231 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:20:52,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-12-01 15:20:52,331 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/data/0db646ff5/44a09829a5a94dc589a79dbc38a4abfa/FLAG5aab7622a [2020-12-01 15:20:53,085 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:20:53,086 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-12-01 15:20:53,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/data/0db646ff5/44a09829a5a94dc589a79dbc38a4abfa/FLAG5aab7622a [2020-12-01 15:20:53,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/bin/uautomizer/data/0db646ff5/44a09829a5a94dc589a79dbc38a4abfa [2020-12-01 15:20:53,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:20:53,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:20:53,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:20:53,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:20:53,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:20:53,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:53,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44108859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53, skipping insertion in model container [2020-12-01 15:20:53,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:53,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:20:53,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:20:53,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:20:53,800 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:20:53,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:20:53,926 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:20:53,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53 WrapperNode [2020-12-01 15:20:53,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:20:53,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:20:53,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:20:53,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:20:53,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:53,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:53,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:20:53,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:20:53,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:20:53,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:20:53,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:53,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... [2020-12-01 15:20:54,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:20:54,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:20:54,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:20:54,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:20:54,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-01 15:20:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:20:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:20:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:20:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:20:54,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:20:54,632 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:20:54,632 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-12-01 15:20:54,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:20:54 BoogieIcfgContainer [2020-12-01 15:20:54,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:20:54,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-12-01 15:20:54,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-12-01 15:20:54,639 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-12-01 15:20:54,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-12-01 15:20:54,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 03:20:53" (1/3) ... [2020-12-01 15:20:54,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2110febc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:20:54, skipping insertion in model container [2020-12-01 15:20:54,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-12-01 15:20:54,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:20:53" (2/3) ... [2020-12-01 15:20:54,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2110febc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:20:54, skipping insertion in model container [2020-12-01 15:20:54,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-12-01 15:20:54,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:20:54" (3/3) ... [2020-12-01 15:20:54,644 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-12-01 15:20:54,724 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-12-01 15:20:54,725 INFO L360 BuchiCegarLoop]: Hoare is false [2020-12-01 15:20:54,725 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-12-01 15:20:54,725 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:20:54,725 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:20:54,725 INFO L364 BuchiCegarLoop]: Difference is false [2020-12-01 15:20:54,725 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:20:54,725 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-12-01 15:20:54,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-12-01 15:20:54,760 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-12-01 15:20:54,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:20:54,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:20:54,767 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-12-01 15:20:54,767 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-12-01 15:20:54,768 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-12-01 15:20:54,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-12-01 15:20:54,771 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-12-01 15:20:54,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:20:54,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:20:54,771 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-12-01 15:20:54,772 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-12-01 15:20:54,780 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-12-01 15:20:54,780 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-12-01 15:20:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-12-01 15:20:54,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:54,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616910756] [2020-12-01 15:20:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:54,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:54,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:55,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-12-01 15:20:55,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:55,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918384645] [2020-12-01 15:20:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:55,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:55,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:55,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-12-01 15:20:55,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:55,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779529049] [2020-12-01 15:20:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:55,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:55,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:55,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:55,351 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 15:20:55,432 INFO L210 LassoAnalysis]: Preferences: [2020-12-01 15:20:55,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-12-01 15:20:55,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-12-01 15:20:55,434 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-12-01 15:20:55,434 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-12-01 15:20:55,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:55,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-12-01 15:20:55,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-12-01 15:20:55,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-12-01 15:20:55,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-12-01 15:20:55,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-12-01 15:20:55,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:55,982 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-12-01 15:20:55,986 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:55,996 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-12-01 15:20:55,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:55,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:55,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:55,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:55,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:56,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:56,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-12-01 15:20:56,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:56,070 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-12-01 15:20:56,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:56,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:56,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:56,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:56,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:56,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:56,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:56,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:56,128 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-12-01 15:20:56,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:56,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:56,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:56,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:56,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:20:56,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-12-01 15:20:56,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:56,188 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-12-01 15:20:56,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:56,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:56,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:56,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:56,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:56,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:56,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-12-01 15:20:56,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:56,215 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-12-01 15:20:56,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:56,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:56,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:56,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:56,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:20:56,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-12-01 15:20:56,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-12-01 15:20:56,333 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-12-01 15:20:56,334 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:56,433 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-12-01 15:20:56,454 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-12-01 15:20:56,455 INFO L510 LassoAnalysis]: Proved termination. [2020-12-01 15:20:56,455 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2020-12-01 15:20:56,497 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-12-01 15:20:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:20:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-01 15:20:56,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:20:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:20:56,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:20:56,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:20:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:20:56,596 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-12-01 15:20:56,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2020-12-01 15:20:56,694 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 65 states and 99 transitions. Complement of second has 7 states. [2020-12-01 15:20:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-12-01 15:20:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-12-01 15:20:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-12-01 15:20:56,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2020-12-01 15:20:56,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:20:56,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2020-12-01 15:20:56,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:20:56,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2020-12-01 15:20:56,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:20:56,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2020-12-01 15:20:56,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-12-01 15:20:56,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2020-12-01 15:20:56,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-12-01 15:20:56,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-12-01 15:20:56,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-12-01 15:20:56,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-12-01 15:20:56,714 INFO L692 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-12-01 15:20:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-12-01 15:20:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-12-01 15:20:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-01 15:20:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-12-01 15:20:56,735 INFO L715 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-12-01 15:20:56,735 INFO L595 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-12-01 15:20:56,736 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-12-01 15:20:56,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-12-01 15:20:56,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-12-01 15:20:56,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:20:56,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:20:56,737 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-12-01 15:20:56,738 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-12-01 15:20:56,738 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 158#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; 159#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 165#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; 160#L535-3 assume !(main_~i~1 < main_~array_size~0); 161#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; 151#L517-3 [2020-12-01 15:20:56,738 INFO L796 eck$LassoCheckResult]: Loop: 151#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); 150#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 151#L517-3 [2020-12-01 15:20:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-12-01 15:20:56,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:56,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503502174] [2020-12-01 15:20:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:20:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:20:56,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503502174] [2020-12-01 15:20:56,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:20:56,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:20:56,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46080794] [2020-12-01 15:20:56,805 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-12-01 15:20:56,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-12-01 15:20:56,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:56,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938035776] [2020-12-01 15:20:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:56,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:56,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:56,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:56,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:20:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:20:56,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:20:56,897 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-12-01 15:20:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:20:56,935 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-12-01 15:20:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:20:56,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-12-01 15:20:56,941 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-12-01 15:20:56,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-12-01 15:20:56,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-12-01 15:20:56,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-12-01 15:20:56,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-12-01 15:20:56,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-12-01 15:20:56,943 INFO L692 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-12-01 15:20:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-12-01 15:20:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-12-01 15:20:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-01 15:20:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-12-01 15:20:56,953 INFO L715 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-12-01 15:20:56,953 INFO L595 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-12-01 15:20:56,953 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-12-01 15:20:56,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-12-01 15:20:56,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-12-01 15:20:56,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:20:56,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:20:56,955 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:20:56,955 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-12-01 15:20:56,955 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#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; 209#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 215#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; 210#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; 206#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 207#L535-3 assume !(main_~i~1 < main_~array_size~0); 211#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; 201#L517-3 [2020-12-01 15:20:56,955 INFO L796 eck$LassoCheckResult]: Loop: 201#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); 200#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 201#L517-3 [2020-12-01 15:20:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-12-01 15:20:56,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:56,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870667239] [2020-12-01 15:20:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:56,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:57,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,025 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-12-01 15:20:57,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:57,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714300179] [2020-12-01 15:20:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:57,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:57,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:20:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-12-01 15:20:57,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:20:57,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225900051] [2020-12-01 15:20:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:20:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:57,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:20:57,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:20:57,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:20:57,582 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2020-12-01 15:20:57,760 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-01 15:20:57,763 INFO L210 LassoAnalysis]: Preferences: [2020-12-01 15:20:57,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-12-01 15:20:57,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-12-01 15:20:57,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-12-01 15:20:57,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-12-01 15:20:57,764 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:57,764 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-12-01 15:20:57,764 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-12-01 15:20:57,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-12-01 15:20:57,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-12-01 15:20:57,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-12-01 15:20:57,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:57,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,176 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-12-01 15:20:58,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-12-01 15:20:58,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-12-01 15:20:58,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-12-01 15:20:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,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-12-01 15:20:58,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-12-01 15:20:58,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-12-01 15:20:58,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:20:58,646 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-12-01 15:20:58,990 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-01 15:20:59,170 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-12-01 15:20:59,173 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:59,181 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-12-01 15:20:59,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:59,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:59,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-12-01 15:20:59,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:59,232 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-12-01 15:20:59,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:20:59,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-12-01 15:20:59,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:59,322 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-12-01 15:20:59,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:59,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:59,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:59,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:59,398 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-12-01 15:20:59,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:59,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:59,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:59,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:59,469 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-12-01 15:20:59,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:20:59,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:59,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:59,543 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-12-01 15:20:59,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:59,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:59,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-12-01 15:20:59,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:20:59,606 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-12-01 15:20:59,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:20:59,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:20:59,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:59,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:59,681 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-12-01 15:20:59,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:20:59,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:20:59,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:20:59,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:20:59,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:20:59,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-12-01 15:20:59,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-12-01 15:20:59,796 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-12-01 15:20:59,796 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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:20:59,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:20:59,845 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-12-01 15:20:59,846 INFO L510 LassoAnalysis]: Proved termination. [2020-12-01 15:20:59,846 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-12-01 15:20:59,964 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-12-01 15:20:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:00,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-01 15:21:00,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:00,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:21:00,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:21:00,058 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-12-01 15:21:00,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-12-01 15:21:00,088 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-12-01 15:21:00,088 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-12-01 15:21:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-12-01 15:21:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-12-01 15:21:00,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-12-01 15:21:00,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:00,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-12-01 15:21:00,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:00,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-12-01 15:21:00,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:00,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-12-01 15:21:00,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-12-01 15:21:00,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-12-01 15:21:00,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-12-01 15:21:00,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-12-01 15:21:00,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-12-01 15:21:00,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-12-01 15:21:00,100 INFO L692 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-12-01 15:21:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-12-01 15:21:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-12-01 15:21:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-01 15:21:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-12-01 15:21:00,108 INFO L715 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-12-01 15:21:00,108 INFO L595 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-12-01 15:21:00,108 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-12-01 15:21:00,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-12-01 15:21:00,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-12-01 15:21:00,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:00,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:00,112 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:00,112 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-12-01 15:21:00,114 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 380#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; 381#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 387#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; 382#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; 378#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 379#L535-3 assume !(main_~i~1 < main_~array_size~0); 383#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; 374#L517-3 assume !(lis_~i~0 < lis_~N); 375#L517-4 lis_~i~0 := 1; 368#L519-3 [2020-12-01 15:21:00,115 INFO L796 eck$LassoCheckResult]: Loop: 368#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 370#L520-3 assume !(lis_~j~0 < lis_~i~0); 389#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 368#L519-3 [2020-12-01 15:21:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-12-01 15:21:00,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:00,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853776542] [2020-12-01 15:21:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-01 15:21:00,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853776542] [2020-12-01 15:21:00,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:21:00,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:21:00,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766331810] [2020-12-01 15:21:00,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-12-01 15:21:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-12-01 15:21:00,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:00,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210279417] [2020-12-01 15:21:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:00,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:00,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:00,259 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:00,276 INFO L210 LassoAnalysis]: Preferences: [2020-12-01 15:21:00,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-12-01 15:21:00,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-12-01 15:21:00,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-12-01 15:21:00,277 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-12-01 15:21:00,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:00,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-12-01 15:21:00,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-12-01 15:21:00,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-12-01 15:21:00,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-12-01 15:21:00,278 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-12-01 15:21:00,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,371 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-12-01 15:21:00,372 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:00,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-12-01 15:21:00,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-12-01 15:21:00,407 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-12-01 15:21:00,407 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:00,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-12-01 15:21:00,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-12-01 15:21:00,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-12-01 15:21:00,435 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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:00,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-12-01 15:21:00,460 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:00,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-12-01 15:21:00,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-12-01 15:21:00,697 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-12-01 15:21:00,699 INFO L210 LassoAnalysis]: Preferences: [2020-12-01 15:21:00,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-12-01 15:21:00,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-12-01 15:21:00,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-12-01 15:21:00,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-12-01 15:21:00,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:00,700 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-12-01 15:21:00,700 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-12-01 15:21:00,700 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-12-01 15:21:00,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-12-01 15:21:00,700 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-12-01 15:21:00,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:00,797 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-12-01 15:21:00,798 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:21:00,810 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-12-01 15:21:00,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:21:00,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:21:00,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:21:00,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:21:00,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:21:00,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:00,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:00,877 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-12-01 15:21:00,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:21:00,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:21:00,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:21:00,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:21:00,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-12-01 15:21:00,889 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-12-01 15:21:00,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:00,937 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-12-01 15:21:00,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-12-01 15:21:00,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-12-01 15:21:00,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-12-01 15:21:00,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-12-01 15:21:00,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-12-01 15:21:00,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-12-01 15:21:00,941 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-12-01 15:21:00,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-12-01 15:21:00,963 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-12-01 15:21:00,963 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_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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) [2020-12-01 15:21:00,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-12-01 15:21:00,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-12-01 15:21:00,968 INFO L510 LassoAnalysis]: Proved termination. [2020-12-01 15:21:00,968 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:01,004 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-12-01 15:21:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:01,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-01 15:21:01,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:01,063 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:21:01,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:21:01,083 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-12-01 15:21:01,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-12-01 15:21:01,181 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-12-01 15:21:01,182 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-12-01 15:21:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-12-01 15:21:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-12-01 15:21:01,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2020-12-01 15:21:01,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:01,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 3 letters. [2020-12-01 15:21:01,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:01,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2020-12-01 15:21:01,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-12-01 15:21:01,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2020-12-01 15:21:01,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:01,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 42 transitions. [2020-12-01 15:21:01,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-12-01 15:21:01,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-12-01 15:21:01,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-12-01 15:21:01,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:01,199 INFO L692 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-12-01 15:21:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-12-01 15:21:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-12-01 15:21:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-01 15:21:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-12-01 15:21:01,201 INFO L715 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-12-01 15:21:01,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:21:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:21:01,202 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-12-01 15:21:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:01,251 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-12-01 15:21:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:21:01,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-12-01 15:21:01,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:01,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 41 transitions. [2020-12-01 15:21:01,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-12-01 15:21:01,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-12-01 15:21:01,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-12-01 15:21:01,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:01,254 INFO L692 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-12-01 15:21:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-12-01 15:21:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-12-01 15:21:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-01 15:21:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-12-01 15:21:01,257 INFO L715 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-12-01 15:21:01,257 INFO L595 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-12-01 15:21:01,257 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-12-01 15:21:01,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-12-01 15:21:01,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:01,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:01,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:01,259 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:01,259 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-12-01 15:21:01,259 INFO L794 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 556#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; 557#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 563#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; 554#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; 552#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 553#L535-3 assume !(main_~i~1 < main_~array_size~0); 555#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; 548#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); 545#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 546#L517-3 assume !(lis_~i~0 < lis_~N); 549#L517-4 lis_~i~0 := 1; 540#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 543#L520-3 [2020-12-01 15:21:01,260 INFO L796 eck$LassoCheckResult]: Loop: 543#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; 558#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; 559#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~mem8; 564#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 543#L520-3 [2020-12-01 15:21:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-12-01 15:21:01,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:01,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55086420] [2020-12-01 15:21:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-01 15:21:01,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55086420] [2020-12-01 15:21:01,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322026713] [2020-12-01 15:21:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:01,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-01 15:21:01,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-01 15:21:01,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:21:01,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-12-01 15:21:01,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603044612] [2020-12-01 15:21:01,499 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-12-01 15:21:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-12-01 15:21:01,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:01,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16824852] [2020-12-01 15:21:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:01,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:01,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:01,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:01,649 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-01 15:21:01,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:21:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:21:01,685 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-12-01 15:21:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:01,951 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2020-12-01 15:21:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-01 15:21:01,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2020-12-01 15:21:01,953 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-12-01 15:21:01,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 66 transitions. [2020-12-01 15:21:01,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-12-01 15:21:01,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-12-01 15:21:01,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2020-12-01 15:21:01,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:01,955 INFO L692 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2020-12-01 15:21:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2020-12-01 15:21:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-12-01 15:21:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-01 15:21:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-12-01 15:21:01,959 INFO L715 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-12-01 15:21:01,959 INFO L595 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-12-01 15:21:01,959 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-12-01 15:21:01,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-12-01 15:21:01,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:01,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:01,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:01,962 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:01,962 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-12-01 15:21:01,962 INFO L794 eck$LassoCheckResult]: Stem: 723#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 715#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; 716#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 725#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; 717#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; 714#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; 718#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 729#L535-3 assume !(main_~i~1 < main_~array_size~0); 724#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; 707#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); 708#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 709#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); 704#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 705#L517-3 assume !(lis_~i~0 < lis_~N); 712#L517-4 lis_~i~0 := 1; 699#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 701#L520-3 [2020-12-01 15:21:01,962 INFO L796 eck$LassoCheckResult]: Loop: 701#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; 719#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; 720#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~mem8; 726#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 701#L520-3 [2020-12-01 15:21:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2020-12-01 15:21:01,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:01,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025629341] [2020-12-01 15:21:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:02,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:02,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:02,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2020-12-01 15:21:02,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:02,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848215162] [2020-12-01 15:21:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:02,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:02,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:02,089 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-12-01 15:21:02,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:02,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940196093] [2020-12-01 15:21:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:21:02,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940196093] [2020-12-01 15:21:02,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32549833] [2020-12-01 15:21:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:02,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-01 15:21:02,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:02,571 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2020-12-01 15:21:02,575 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-01 15:21:02,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-01 15:21:02,580 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-01 15:21:02,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-12-01 15:21:02,607 INFO L382 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-12-01 15:21:02,621 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-01 15:21:02,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-01 15:21:02,631 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-01 15:21:02,632 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-12-01 15:21:02,767 INFO L348 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-12-01 15:21:02,774 INFO L382 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 48 treesize of output 39 [2020-12-01 15:21:02,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-01 15:21:02,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-01 15:21:02,799 INFO L547 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-12-01 15:21:02,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2020-12-01 15:21:03,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:21:03,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:21:03,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:21:03,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:21:03,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:21:03,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:21:03,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:21:03,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:21:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-01 15:21:03,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:21:03,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2020-12-01 15:21:03,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539922352] [2020-12-01 15:21:03,340 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-01 15:21:03,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:21:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:21:03,376 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 19 states. [2020-12-01 15:21:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:04,210 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2020-12-01 15:21:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:21:04,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 99 transitions. [2020-12-01 15:21:04,213 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2020-12-01 15:21:04,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 99 transitions. [2020-12-01 15:21:04,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-12-01 15:21:04,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-12-01 15:21:04,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 99 transitions. [2020-12-01 15:21:04,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:04,216 INFO L692 BuchiCegarLoop]: Abstraction has 69 states and 99 transitions. [2020-12-01 15:21:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 99 transitions. [2020-12-01 15:21:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2020-12-01 15:21:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-01 15:21:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2020-12-01 15:21:04,222 INFO L715 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-12-01 15:21:04,222 INFO L595 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-12-01 15:21:04,222 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-12-01 15:21:04,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 56 transitions. [2020-12-01 15:21:04,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:04,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:04,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:04,224 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:04,224 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-12-01 15:21:04,225 INFO L794 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 915#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; 916#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 926#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; 917#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; 913#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 914#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; 918#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 932#L535-3 assume !(main_~i~1 < main_~array_size~0); 925#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; 907#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); 904#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 905#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); 908#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 936#L517-3 assume !(lis_~i~0 < lis_~N); 911#L517-4 lis_~i~0 := 1; 912#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 938#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; 939#L521 assume !lis_#t~short11; 920#L521-2 [2020-12-01 15:21:04,225 INFO L796 eck$LassoCheckResult]: Loop: 920#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~mem8; 928#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 901#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; 919#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; 920#L521-2 [2020-12-01 15:21:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-12-01 15:21:04,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:04,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532229438] [2020-12-01 15:21:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 3 times [2020-12-01 15:21:04,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:04,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234450938] [2020-12-01 15:21:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,301 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-12-01 15:21:04,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:04,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887725651] [2020-12-01 15:21:04,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 15:21:04,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887725651] [2020-12-01 15:21:04,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29336290] [2020-12-01 15:21:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:04,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:21:04,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 15:21:04,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:21:04,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-12-01 15:21:04,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444190133] [2020-12-01 15:21:04,603 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-12-01 15:21:04,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:21:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:21:04,674 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-12-01 15:21:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:04,772 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-12-01 15:21:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:21:04,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-12-01 15:21:04,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:04,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 64 transitions. [2020-12-01 15:21:04,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-12-01 15:21:04,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-12-01 15:21:04,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-12-01 15:21:04,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:04,775 INFO L692 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-12-01 15:21:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-12-01 15:21:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-12-01 15:21:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-01 15:21:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-12-01 15:21:04,779 INFO L715 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-12-01 15:21:04,779 INFO L595 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-12-01 15:21:04,779 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-12-01 15:21:04,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-12-01 15:21:04,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:04,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:04,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:04,786 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:04,786 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-12-01 15:21:04,786 INFO L794 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1095#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; 1096#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1103#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; 1093#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; 1091#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1092#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; 1094#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1110#L535-3 assume !(main_~i~1 < main_~array_size~0); 1101#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; 1084#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); 1085#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1086#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); 1087#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1115#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); 1081#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1082#L517-3 assume !(lis_~i~0 < lis_~N); 1090#L517-4 lis_~i~0 := 1; 1075#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1076#L520-3 assume !(lis_~j~0 < lis_~i~0); 1109#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1077#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1080#L520-3 [2020-12-01 15:21:04,786 INFO L796 eck$LassoCheckResult]: Loop: 1080#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; 1097#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; 1098#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~mem8; 1104#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1080#L520-3 [2020-12-01 15:21:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1189567124, now seen corresponding path program 1 times [2020-12-01 15:21:04,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:04,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312109823] [2020-12-01 15:21:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 15:21:04,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312109823] [2020-12-01 15:21:04,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:21:04,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:21:04,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870159371] [2020-12-01 15:21:04,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-12-01 15:21:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 4 times [2020-12-01 15:21:04,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:04,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679433530] [2020-12-01 15:21:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:04,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:04,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:04,966 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-01 15:21:05,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:21:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:21:05,001 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-12-01 15:21:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:05,050 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-12-01 15:21:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:21:05,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2020-12-01 15:21:05,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:05,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 58 transitions. [2020-12-01 15:21:05,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-12-01 15:21:05,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-12-01 15:21:05,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 58 transitions. [2020-12-01 15:21:05,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:05,053 INFO L692 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-12-01 15:21:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 58 transitions. [2020-12-01 15:21:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-12-01 15:21:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-01 15:21:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-12-01 15:21:05,056 INFO L715 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-12-01 15:21:05,056 INFO L595 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-12-01 15:21:05,056 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-12-01 15:21:05,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-12-01 15:21:05,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:05,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:05,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:05,062 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:21:05,062 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-12-01 15:21:05,062 INFO L794 eck$LassoCheckResult]: Stem: 1194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1185#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; 1186#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1196#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; 1187#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; 1184#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; 1188#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1201#L535-3 assume !(main_~i~1 < main_~array_size~0); 1195#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; 1178#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); 1176#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1177#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); 1179#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1211#L517-3 assume !(lis_~i~0 < lis_~N); 1182#L517-4 lis_~i~0 := 1; 1169#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1170#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; 1191#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; 1192#L521-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 1198#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1203#L520-3 assume !(lis_~j~0 < lis_~i~0); 1200#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1171#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1174#L520-3 [2020-12-01 15:21:05,063 INFO L796 eck$LassoCheckResult]: Loop: 1174#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; 1189#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; 1190#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~mem8; 1197#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1174#L520-3 [2020-12-01 15:21:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 500757827, now seen corresponding path program 1 times [2020-12-01 15:21:05,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:05,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680430894] [2020-12-01 15:21:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:21:05,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680430894] [2020-12-01 15:21:05,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229040099] [2020-12-01 15:21:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49eb0c33-0ed7-4adc-8150-7902074ed2f2/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-12-01 15:21:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:21:05,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-01 15:21:05,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:21:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:21:05,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:21:05,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-12-01 15:21:05,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455527160] [2020-12-01 15:21:05,321 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-12-01 15:21:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 5 times [2020-12-01 15:21:05,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:05,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891367071] [2020-12-01 15:21:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:05,468 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-01 15:21:05,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:21:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:21:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:21:05,502 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-12-01 15:21:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:21:05,674 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2020-12-01 15:21:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:21:05,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 93 transitions. [2020-12-01 15:21:05,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-12-01 15:21:05,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 93 transitions. [2020-12-01 15:21:05,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-12-01 15:21:05,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-12-01 15:21:05,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2020-12-01 15:21:05,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-12-01 15:21:05,679 INFO L692 BuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2020-12-01 15:21:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2020-12-01 15:21:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-12-01 15:21:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-01 15:21:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2020-12-01 15:21:05,684 INFO L715 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-12-01 15:21:05,684 INFO L595 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-12-01 15:21:05,684 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-12-01 15:21:05,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 87 transitions. [2020-12-01 15:21:05,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-12-01 15:21:05,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-12-01 15:21:05,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-12-01 15:21:05,686 INFO L853 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-12-01 15:21:05,686 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-12-01 15:21:05,687 INFO L794 eck$LassoCheckResult]: Stem: 1405#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1395#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; 1396#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1406#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; 1397#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; 1398#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1435#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; 1434#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1433#L535-3 assume !(main_~i~1 < main_~array_size~0); 1432#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; 1431#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); 1430#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1429#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); 1428#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1427#L517-3 assume !(lis_~i~0 < lis_~N); 1424#L517-4 lis_~i~0 := 1; 1422#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1420#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; 1418#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; 1416#L521-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 1414#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1413#L520-3 assume !(lis_~j~0 < lis_~i~0); 1410#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1411#L519-3 assume !(lis_~i~0 < lis_~N); 1381#L519-4 lis_~i~0 := 0; 1386#L523-3 [2020-12-01 15:21:05,687 INFO L796 eck$LassoCheckResult]: Loop: 1386#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); 1389#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; 1390#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1386#L523-3 [2020-12-01 15:21:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2020-12-01 15:21:05,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:05,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987739146] [2020-12-01 15:21:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-12-01 15:21:05,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:05,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832992888] [2020-12-01 15:21:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:21:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2020-12-01 15:21:05,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:21:05,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893549910] [2020-12-01 15:21:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:21:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:21:05,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:21:05,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:21:11,602 WARN L197 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2020-12-01 15:21:13,437 WARN L197 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 146 [2020-12-01 15:21:13,440 INFO L210 LassoAnalysis]: Preferences: [2020-12-01 15:21:13,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-12-01 15:21:13,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-12-01 15:21:13,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-12-01 15:21:13,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-12-01 15:21:13,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-12-01 15:21:13,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-12-01 15:21:13,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-12-01 15:21:13,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2020-12-01 15:21:13,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-12-01 15:21:13,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-12-01 15:21:13,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:13,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-12-01 15:21:14,800 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:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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-12-01 15:21:14,823 INFO L168 Benchmark]: Toolchain (without parser) took 21502.13 ms. Allocated memory was 102.8 MB in the beginning and 249.6 MB in the end (delta: 146.8 MB). Free memory was 67.6 MB in the beginning and 161.5 MB in the end (delta: -93.9 MB). Peak memory consumption was 111.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,823 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 75.5 MB. Free memory was 53.9 MB in the beginning and 53.9 MB in the end (delta: 21.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:21:14,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.82 ms. Allocated memory is still 102.8 MB. Free memory was 67.4 MB in the beginning and 68.0 MB in the end (delta: -630.0 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 102.8 MB. Free memory was 68.0 MB in the beginning and 66.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,825 INFO L168 Benchmark]: Boogie Preprocessor took 62.82 ms. Allocated memory is still 102.8 MB. Free memory was 66.0 MB in the beginning and 64.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,825 INFO L168 Benchmark]: RCFGBuilder took 584.73 ms. Allocated memory is still 102.8 MB. Free memory was 64.3 MB in the beginning and 79.1 MB in the end (delta: -14.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,826 INFO L168 Benchmark]: BuchiAutomizer took 20187.09 ms. Allocated memory was 102.8 MB in the beginning and 249.6 MB in the end (delta: 146.8 MB). Free memory was 79.0 MB in the beginning and 161.5 MB in the end (delta: -82.5 MB). Peak memory consumption was 121.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:21:14,829 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.77 ms. Allocated memory is still 75.5 MB. Free memory was 53.9 MB in the beginning and 53.9 MB in the end (delta: 21.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 607.82 ms. Allocated memory is still 102.8 MB. Free memory was 67.4 MB in the beginning and 68.0 MB in the end (delta: -630.0 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 102.8 MB. Free memory was 68.0 MB in the beginning and 66.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.82 ms. Allocated memory is still 102.8 MB. Free memory was 66.0 MB in the beginning and 64.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 584.73 ms. Allocated memory is still 102.8 MB. Free memory was 64.3 MB in the beginning and 79.1 MB in the end (delta: -14.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20187.09 ms. Allocated memory was 102.8 MB in the beginning and 249.6 MB in the end (delta: 146.8 MB). Free memory was 79.0 MB in the beginning and 161.5 MB in the end (delta: -82.5 MB). Peak memory consumption was 121.8 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...