./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC --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 862be090098a4271d6e1a31a6f1302665ccfc795 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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-7b2dab5 [2021-10-11 00:30:05,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:30:05,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:30:05,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:30:05,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:30:05,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:30:05,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:30:05,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:30:05,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:30:06,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:30:06,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:30:06,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:30:06,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:30:06,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:30:06,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:30:06,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:30:06,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:30:06,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:30:06,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:30:06,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:30:06,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:30:06,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:30:06,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:30:06,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:30:06,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:30:06,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:30:06,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:30:06,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:30:06,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:30:06,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:30:06,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:30:06,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:30:06,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:30:06,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:30:06,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:30:06,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:30:06,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:30:06,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:30:06,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:30:06,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:30:06,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:30:06,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:30:06,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:30:06,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:30:06,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:30:06,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:30:06,081 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:30:06,081 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:30:06,082 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:30:06,082 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:30:06,082 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:30:06,082 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:30:06,083 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:30:06,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:30:06,083 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:30:06,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:30:06,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:30:06,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:30:06,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:30:06,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:30:06,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:30:06,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:30:06,085 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:30:06,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:30:06,085 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:30:06,086 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:30:06,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:30:06,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:30:06,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:30:06,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:30:06,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:30:06,087 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:30:06,088 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:30:06,088 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_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC 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 -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2021-10-11 00:30:06,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:30:06,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:30:06,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:30:06,401 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:30:06,402 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:30:06,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-10-11 00:30:06,474 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/data/da0efdf5d/b8641015fd0d4408a456c32e0e307e60/FLAGd2424ff50 [2021-10-11 00:30:06,982 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:30:06,983 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-10-11 00:30:07,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/data/da0efdf5d/b8641015fd0d4408a456c32e0e307e60/FLAGd2424ff50 [2021-10-11 00:30:07,481 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/data/da0efdf5d/b8641015fd0d4408a456c32e0e307e60 [2021-10-11 00:30:07,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:30:07,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:30:07,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:30:07,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:30:07,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:30:07,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eed0737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07, skipping insertion in model container [2021-10-11 00:30:07,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:30:07,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:30:07,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:30:07,859 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:30:07,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:30:07,941 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:30:07,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07 WrapperNode [2021-10-11 00:30:07,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:30:07,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:30:07,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:30:07,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:30:07,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:30:07,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:30:07,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:30:07,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:30:07,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:07,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:08,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:08,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:08,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... [2021-10-11 00:30:08,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:30:08,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:30:08,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:30:08,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:30:08,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 00:30:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:30:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:30:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:30:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:30:08,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:30:08,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:30:08,347 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-11 00:30:08,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:08 BoogieIcfgContainer [2021-10-11 00:30:08,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:30:08,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:30:08,350 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:30:08,353 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:30:08,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:30:08,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:30:07" (1/3) ... [2021-10-11 00:30:08,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cb7349d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:30:08, skipping insertion in model container [2021-10-11 00:30:08,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:30:08,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:07" (2/3) ... [2021-10-11 00:30:08,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cb7349d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:30:08, skipping insertion in model container [2021-10-11 00:30:08,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:30:08,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:08" (3/3) ... [2021-10-11 00:30:08,358 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2021-10-11 00:30:08,438 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:30:08,438 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:30:08,438 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:30:08,438 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:30:08,439 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:30:08,439 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:30:08,439 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:30:08,439 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:30:08,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2021-10-11 00:30:08,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-10-11 00:30:08,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:08,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:08,478 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-11 00:30:08,479 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:30:08,479 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:30:08,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2021-10-11 00:30:08,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-10-11 00:30:08,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:08,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:08,482 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-11 00:30:08,482 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:30:08,489 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 4#L528-3true [2021-10-11 00:30:08,490 INFO L796 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 3#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 4#L528-3true [2021-10-11 00:30:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-10-11 00:30:08,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:08,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332051769] [2021-10-11 00:30:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-10-11 00:30:08,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:08,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461401664] [2021-10-11 00:30:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-10-11 00:30:08,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:08,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808110995] [2021-10-11 00:30:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:08,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:08,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:09,101 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:30:09,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:30:09,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:30:09,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:30:09,102 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:30:09,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:30:09,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:30:09,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2021-10-11 00:30:09,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:30:09,103 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:30:09,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:09,537 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:30:09,541 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,556 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 [2021-10-11 00:30:09,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:09,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:09,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:09,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:09,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,598 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 [2021-10-11 00:30:09,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:09,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:09,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:09,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:09,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:09,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:30:09,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:09,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:09,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:09,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:09,738 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 [2021-10-11 00:30:09,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:09,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:09,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:09,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:09,797 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 [2021-10-11 00:30:09,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:09,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:09,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:09,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:09,852 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 [2021-10-11 00:30:09,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:09,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:09,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:09,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:09,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:09,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:09,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:30:09,956 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-10-11 00:30:09,956 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:09,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:10,024 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-10-11 00:30:10,025 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:30:10,025 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2021-10-11 00:30:10,073 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-10-11 00:30:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:10,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 00:30:10,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:10,182 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-11 00:30:10,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:10,260 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-10-11 00:30:10,261 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2021-10-11 00:30:10,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 35 states and 53 transitions. Complement of second has 9 states. [2021-10-11 00:30:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-11 00:30:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-11 00:30:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2021-10-11 00:30:10,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-11 00:30:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:10,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2021-10-11 00:30:10,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:10,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2021-10-11 00:30:10,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:10,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2021-10-11 00:30:10,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-11 00:30:10,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2021-10-11 00:30:10,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-11 00:30:10,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:30:10,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-10-11 00:30:10,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:30:10,403 INFO L692 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-10-11 00:30:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-10-11 00:30:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-10-11 00:30:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-11 00:30:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-10-11 00:30:10,428 INFO L715 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-10-11 00:30:10,428 INFO L595 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-10-11 00:30:10,428 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:30:10,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-10-11 00:30:10,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-11 00:30:10,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:10,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:10,429 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:30:10,429 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:10,430 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 121#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 122#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 124#L528-3 assume !(main_~i~1 < main_~array_size~0); 128#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 131#L515-3 [2021-10-11 00:30:10,430 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 130#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 132#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 131#L515-3 [2021-10-11 00:30:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-10-11 00:30:10,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258367208] [2021-10-11 00:30:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:10,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258367208] [2021-10-11 00:30:10,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:10,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:30:10,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260326017] [2021-10-11 00:30:10,486 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:30:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2021-10-11 00:30:10,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096013264] [2021-10-11 00:30:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:10,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096013264] [2021-10-11 00:30:10,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:10,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:30:10,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096464507] [2021-10-11 00:30:10,503 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:30:10,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:10,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:10,507 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2021-10-11 00:30:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:10,525 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-10-11 00:30:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:10,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-10-11 00:30:10,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:10,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-10-11 00:30:10,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-10-11 00:30:10,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-10-11 00:30:10,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-10-11 00:30:10,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:30:10,528 INFO L692 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-10-11 00:30:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-10-11 00:30:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-11 00:30:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-11 00:30:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-10-11 00:30:10,530 INFO L715 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-10-11 00:30:10,530 INFO L595 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-10-11 00:30:10,530 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:30:10,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-10-11 00:30:10,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:10,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:10,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:10,532 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:30:10,532 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:30:10,532 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 157#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 158#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 159#L528-3 assume !(main_~i~1 < main_~array_size~0); 163#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 166#L515-3 [2021-10-11 00:30:10,533 INFO L796 eck$LassoCheckResult]: Loop: 166#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 164#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 165#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 169#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 166#L515-3 [2021-10-11 00:30:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2021-10-11 00:30:10,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574406265] [2021-10-11 00:30:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:10,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574406265] [2021-10-11 00:30:10,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:10,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:30:10,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732393244] [2021-10-11 00:30:10,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:30:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2021-10-11 00:30:10,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763157872] [2021-10-11 00:30:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:10,783 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-10-11 00:30:10,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:10,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:30:10,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:30:10,839 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2021-10-11 00:30:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:10,870 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-10-11 00:30:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:30:10,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-10-11 00:30:10,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:10,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-10-11 00:30:10,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-10-11 00:30:10,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-10-11 00:30:10,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-10-11 00:30:10,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:30:10,874 INFO L692 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-10-11 00:30:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-10-11 00:30:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-10-11 00:30:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-11 00:30:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2021-10-11 00:30:10,876 INFO L715 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-10-11 00:30:10,876 INFO L595 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-10-11 00:30:10,877 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:30:10,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2021-10-11 00:30:10,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:10,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:10,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:10,878 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:10,878 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:30:10,879 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 192#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 193#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 194#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 195#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 196#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 197#L528-3 assume !(main_~i~1 < main_~array_size~0); 199#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 202#L515-3 [2021-10-11 00:30:10,879 INFO L796 eck$LassoCheckResult]: Loop: 202#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 203#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 204#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 200#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 201#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 205#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 202#L515-3 [2021-10-11 00:30:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-10-11 00:30:10,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977486416] [2021-10-11 00:30:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2021-10-11 00:30:10,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420318817] [2021-10-11 00:30:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:10,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:10,926 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2021-10-11 00:30:10,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:10,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094883344] [2021-10-11 00:30:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:11,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094883344] [2021-10-11 00:30:11,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221473676] [2021-10-11 00:30:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:30:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:11,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-11 00:30:11,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:30:11,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:30:11,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-10-11 00:30:11,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228102248] [2021-10-11 00:30:11,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 00:30:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:30:11,394 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 11 states. [2021-10-11 00:30:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:11,559 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-11 00:30:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:30:11,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-10-11 00:30:11,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:11,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2021-10-11 00:30:11,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-10-11 00:30:11,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-10-11 00:30:11,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-10-11 00:30:11,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:30:11,570 INFO L692 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-10-11 00:30:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-10-11 00:30:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-10-11 00:30:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-11 00:30:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-10-11 00:30:11,574 INFO L715 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-10-11 00:30:11,574 INFO L595 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-10-11 00:30:11,574 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:30:11,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-10-11 00:30:11,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-11 00:30:11,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:11,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:11,578 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:11,578 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:30:11,579 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 291#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 292#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 293#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 294#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 297#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 305#L528-3 assume !(main_~i~1 < main_~array_size~0); 300#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 301#L515-3 [2021-10-11 00:30:11,579 INFO L796 eck$LassoCheckResult]: Loop: 301#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 302#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 303#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 298#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 299#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 304#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 301#L515-3 [2021-10-11 00:30:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2021-10-11 00:30:11,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:11,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558940151] [2021-10-11 00:30:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,634 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2021-10-11 00:30:11,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:11,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977188339] [2021-10-11 00:30:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2021-10-11 00:30:11,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:11,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817373997] [2021-10-11 00:30:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:11,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:11,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:12,110 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2021-10-11 00:30:12,216 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:30:12,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:30:12,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:30:12,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:30:12,216 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:30:12,216 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:12,216 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:30:12,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:30:12,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2021-10-11 00:30:12,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:30:12,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:30:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:12,595 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-10-11 00:30:12,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:30:12,835 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:12,838 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 [2021-10-11 00:30:12,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:12,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:12,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:12,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:12,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:12,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:12,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:12,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:12,865 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 [2021-10-11 00:30:12,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:12,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:12,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:12,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:12,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:12,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:12,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:12,934 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 [2021-10-11 00:30:12,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:12,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:12,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:12,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:12,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:12,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:12,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:12,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:12,995 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 [2021-10-11 00:30:12,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:12,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:12,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:12,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:12,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:12,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:12,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:12,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,021 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 [2021-10-11 00:30:13,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:13,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:13,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:13,049 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 [2021-10-11 00:30:13,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,090 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 [2021-10-11 00:30:13,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:13,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 [2021-10-11 00:30:13,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:13,153 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 [2021-10-11 00:30:13,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:13,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:13,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:30:13,180 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 [2021-10-11 00:30:13,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:13,214 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 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,247 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 [2021-10-11 00:30:13,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,295 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 [2021-10-11 00:30:13,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:13,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:13,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,324 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 [2021-10-11 00:30:13,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,359 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 [2021-10-11 00:30:13,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:13,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:13,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,432 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 [2021-10-11 00:30:13,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:13,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:13,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:13,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,481 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 [2021-10-11 00:30:13,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:13,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:13,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:13,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:13,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:13,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:13,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:30:13,550 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-11 00:30:13,550 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:13,552 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:30:13,557 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-11 00:30:13,557 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:30:13,557 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2021-10-11 00:30:13,586 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-10-11 00:30:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:13,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:30:13,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:13,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:30:13,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:30:13,655 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 [2021-10-11 00:30:13,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2021-10-11 00:30:13,684 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 4 states. [2021-10-11 00:30:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-11 00:30:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:30:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-10-11 00:30:13,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2021-10-11 00:30:13,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:13,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2021-10-11 00:30:13,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:13,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2021-10-11 00:30:13,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:13,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2021-10-11 00:30:13,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:13,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2021-10-11 00:30:13,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-11 00:30:13,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:30:13,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-10-11 00:30:13,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:30:13,688 INFO L692 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-10-11 00:30:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-10-11 00:30:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-10-11 00:30:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 00:30:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-10-11 00:30:13,690 INFO L715 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-10-11 00:30:13,690 INFO L595 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-10-11 00:30:13,690 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-11 00:30:13,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-10-11 00:30:13,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:13,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:13,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:13,691 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:13,691 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:13,692 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 412#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 413#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 414#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 415#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 419#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 420#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 416#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 417#L528-3 assume !(main_~i~1 < main_~array_size~0); 425#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 426#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 422#L516-3 [2021-10-11 00:30:13,692 INFO L796 eck$LassoCheckResult]: Loop: 422#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 427#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 421#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 422#L516-3 [2021-10-11 00:30:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2021-10-11 00:30:13,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:13,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092657130] [2021-10-11 00:30:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,725 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-10-11 00:30:13,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:13,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256547821] [2021-10-11 00:30:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2021-10-11 00:30:13,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:13,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630392379] [2021-10-11 00:30:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:13,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:13,783 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:14,060 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2021-10-11 00:30:14,127 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:30:14,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:30:14,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:30:14,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:30:14,128 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:30:14,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:30:14,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:30:14,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2021-10-11 00:30:14,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:30:14,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:30:14,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,312 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2021-10-11 00:30:14,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:14,553 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-10-11 00:30:14,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:30:14,763 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,770 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 [2021-10-11 00:30:14,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:14,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:14,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:14,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,796 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 [2021-10-11 00:30:14,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:14,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:14,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:14,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,828 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 [2021-10-11 00:30:14,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:14,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:14,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,856 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 [2021-10-11 00:30:14,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:30:14,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:30:14,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:30:14,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,881 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 [2021-10-11 00:30:14,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:14,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:14,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:14,910 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 [2021-10-11 00:30:14,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:30:14,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:30:14,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:30:14,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:30:14,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:30:14,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:30:14,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:30:15,032 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-11 00:30:15,032 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:30:15,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:15,051 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-11 00:30:15,051 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:30:15,051 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2021-10-11 00:30:15,082 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-10-11 00:30:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:15,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:30:15,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:15,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:30:15,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:15,179 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 [2021-10-11 00:30:15,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2021-10-11 00:30:15,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 50 transitions. Complement of second has 7 states. [2021-10-11 00:30:15,204 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 [2021-10-11 00:30:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:30:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-10-11 00:30:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2021-10-11 00:30:15,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2021-10-11 00:30:15,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:15,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2021-10-11 00:30:15,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:30:15,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-10-11 00:30:15,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:15,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2021-10-11 00:30:15,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-11 00:30:15,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-10-11 00:30:15,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2021-10-11 00:30:15,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:30:15,213 INFO L692 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-10-11 00:30:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2021-10-11 00:30:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-10-11 00:30:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 00:30:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-10-11 00:30:15,217 INFO L715 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-10-11 00:30:15,217 INFO L595 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-10-11 00:30:15,217 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-11 00:30:15,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-10-11 00:30:15,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:15,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:15,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:15,227 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:15,227 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:15,228 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 559#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 560#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 561#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 562#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 563#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 565#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 577#L528-3 assume !(main_~i~1 < main_~array_size~0); 570#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 571#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 573#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 574#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 568#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 569#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 575#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 576#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 567#L516-3 [2021-10-11 00:30:15,228 INFO L796 eck$LassoCheckResult]: Loop: 567#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 566#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 567#L516-3 [2021-10-11 00:30:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2021-10-11 00:30:15,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:15,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190253788] [2021-10-11 00:30:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:30:15,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190253788] [2021-10-11 00:30:15,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779495073] [2021-10-11 00:30:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:30:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:15,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 00:30:15,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:30:15,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:30:15,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-10-11 00:30:15,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415204425] [2021-10-11 00:30:15,465 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:30:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-10-11 00:30:15,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:15,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885002754] [2021-10-11 00:30:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:15,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:15,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:15,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:15,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 00:30:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:30:15,554 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2021-10-11 00:30:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:15,657 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-10-11 00:30:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:30:15,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-10-11 00:30:15,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:15,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2021-10-11 00:30:15,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-11 00:30:15,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-10-11 00:30:15,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-10-11 00:30:15,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:30:15,660 INFO L692 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-10-11 00:30:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-10-11 00:30:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-10-11 00:30:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-11 00:30:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-10-11 00:30:15,662 INFO L715 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-10-11 00:30:15,662 INFO L595 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-10-11 00:30:15,662 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-11 00:30:15,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-10-11 00:30:15,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:15,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:15,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:15,663 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:15,663 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:15,663 INFO L794 eck$LassoCheckResult]: Stem: 683#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 677#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 678#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 679#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 680#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 681#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 682#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 698#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 684#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 685#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 697#L528-3 assume !(main_~i~1 < main_~array_size~0); 690#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 691#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 695#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 696#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 688#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 689#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 692#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 693#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 687#L516-3 [2021-10-11 00:30:15,663 INFO L796 eck$LassoCheckResult]: Loop: 687#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 694#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 686#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 687#L516-3 [2021-10-11 00:30:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2021-10-11 00:30:15,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:15,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432572406] [2021-10-11 00:30:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:15,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432572406] [2021-10-11 00:30:15,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187576549] [2021-10-11 00:30:15,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:30:15,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-11 00:30:15,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 00:30:15,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:30:15,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-11 00:30:15,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:30:15,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2021-10-11 00:30:15,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47721901] [2021-10-11 00:30:15,930 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:30:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-10-11 00:30:15,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:15,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140534546] [2021-10-11 00:30:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:15,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:15,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:15,941 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:16,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 00:30:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-11 00:30:16,024 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 13 states. [2021-10-11 00:30:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:16,268 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-10-11 00:30:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-11 00:30:16,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-10-11 00:30:16,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:16,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2021-10-11 00:30:16,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-10-11 00:30:16,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-10-11 00:30:16,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2021-10-11 00:30:16,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:30:16,270 INFO L692 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2021-10-11 00:30:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2021-10-11 00:30:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2021-10-11 00:30:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-11 00:30:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-10-11 00:30:16,272 INFO L715 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-10-11 00:30:16,272 INFO L595 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-10-11 00:30:16,272 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-11 00:30:16,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2021-10-11 00:30:16,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:16,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:16,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:16,274 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:16,274 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:16,274 INFO L794 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 834#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 835#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 836#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 837#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 838#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 839#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 841#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 856#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 855#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 854#L528-3 assume !(main_~i~1 < main_~array_size~0); 846#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 847#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 852#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 858#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 844#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 845#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 849#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 853#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 857#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 850#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 851#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 843#L516-3 [2021-10-11 00:30:16,274 INFO L796 eck$LassoCheckResult]: Loop: 843#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 848#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 842#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 843#L516-3 [2021-10-11 00:30:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2021-10-11 00:30:16,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:16,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077667772] [2021-10-11 00:30:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:16,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:16,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:16,307 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-10-11 00:30:16,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:16,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346269132] [2021-10-11 00:30:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:16,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:16,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:16,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2021-10-11 00:30:16,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:16,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089392589] [2021-10-11 00:30:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:30:16,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089392589] [2021-10-11 00:30:16,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638498343] [2021-10-11 00:30:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_966e06d1-8d6c-4f8a-8bcb-3900a756f062/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:30:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:16,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-11 00:30:16,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:30:16,825 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-11 00:30:16,825 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2021-10-11 00:30:16,828 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:30:16,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:30:16,830 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:30:16,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2021-10-11 00:30:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 00:30:16,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:30:16,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2021-10-11 00:30:16,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863528762] [2021-10-11 00:30:16,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-11 00:30:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-10-11 00:30:16,929 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 20 states. [2021-10-11 00:30:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:17,247 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-10-11 00:30:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 00:30:17,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-10-11 00:30:17,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-10-11 00:30:17,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-10-11 00:30:17,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-10-11 00:30:17,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-10-11 00:30:17,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-10-11 00:30:17,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:30:17,251 INFO L692 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-10-11 00:30:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-10-11 00:30:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-10-11 00:30:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-10-11 00:30:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-10-11 00:30:17,254 INFO L715 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-10-11 00:30:17,254 INFO L595 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-10-11 00:30:17,255 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-11 00:30:17,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-10-11 00:30:17,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-10-11 00:30:17,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:30:17,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:30:17,256 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:17,256 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-11 00:30:17,256 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1018#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1019#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1020#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1021#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1022#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1023#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1025#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1044#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1043#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1042#L528-3 assume !(main_~i~1 < main_~array_size~0); 1030#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 1031#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1037#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1048#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 1028#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1029#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1034#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1040#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1047#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 1035#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 1036#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1027#L516-3 [2021-10-11 00:30:17,256 INFO L796 eck$LassoCheckResult]: Loop: 1027#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1051#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1026#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1027#L516-3 [2021-10-11 00:30:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2021-10-11 00:30:17,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:17,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590791229] [2021-10-11 00:30:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2021-10-11 00:30:17,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:17,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224556717] [2021-10-11 00:30:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2021-10-11 00:30:17,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:17,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808816255] [2021-10-11 00:30:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:30:17,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:30:17,336 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:30:18,311 WARN L197 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 136 [2021-10-11 00:30:18,624 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-10-11 00:30:18,627 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:30:18,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:30:18,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:30:18,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:30:18,627 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:30:18,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:30:18,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:30:18,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:30:18,628 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2021-10-11 00:30:18,628 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:30:18,628 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:30:18,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:30:18,710 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) [2021-10-11 00:30:18,713 INFO L168 Benchmark]: Toolchain (without parser) took 11227.80 ms. Allocated memory was 113.2 MB in the beginning and 207.6 MB in the end (delta: 94.4 MB). Free memory was 70.5 MB in the beginning and 121.0 MB in the end (delta: -50.5 MB). Peak memory consumption was 84.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:30:18,713 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 113.2 MB. Free memory is still 88.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:30:18,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.47 ms. Allocated memory is still 113.2 MB. Free memory was 70.2 MB in the beginning and 77.4 MB in the end (delta: -7.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:30:18,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 113.2 MB. Free memory was 77.4 MB in the beginning and 75.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:30:18,714 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 113.2 MB. Free memory was 75.7 MB in the beginning and 74.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:30:18,715 INFO L168 Benchmark]: RCFGBuilder took 337.17 ms. Allocated memory is still 113.2 MB. Free memory was 74.5 MB in the beginning and 58.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:30:18,715 INFO L168 Benchmark]: BuchiAutomizer took 10362.39 ms. Allocated memory was 113.2 MB in the beginning and 207.6 MB in the end (delta: 94.4 MB). Free memory was 58.5 MB in the beginning and 121.0 MB in the end (delta: -62.5 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:30:18,718 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.24 ms. Allocated memory is still 113.2 MB. Free memory is still 88.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 439.47 ms. Allocated memory is still 113.2 MB. Free memory was 70.2 MB in the beginning and 77.4 MB in the end (delta: -7.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 113.2 MB. Free memory was 77.4 MB in the beginning and 75.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.68 ms. Allocated memory is still 113.2 MB. Free memory was 75.7 MB in the beginning and 74.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 337.17 ms. Allocated memory is still 113.2 MB. Free memory was 74.5 MB in the beginning and 58.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 10362.39 ms. Allocated memory was 113.2 MB in the beginning and 207.6 MB in the end (delta: 94.4 MB). Free memory was 58.5 MB in the beginning and 121.0 MB in the end (delta: -62.5 MB). Peak memory consumption was 76.2 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...