./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 862be090098a4271d6e1a31a6f1302665ccfc795 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:32:33,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:32:33,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:32:33,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:32:33,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:32:33,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:32:33,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:32:33,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:32:33,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:32:33,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:32:33,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:32:33,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:32:33,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:32:33,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:32:33,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:32:33,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:32:33,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:32:33,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:32:33,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:32:33,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:32:33,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:32:33,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:32:33,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:32:33,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:32:33,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:32:33,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:32:33,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:32:33,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:32:33,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:32:33,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:32:33,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:32:33,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:32:33,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:32:33,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:32:33,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:32:33,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:32:33,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:32:33,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:32:33,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:32:33,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:32:33,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:32:33,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:32:33,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:32:33,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:32:33,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:32:33,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:32:33,778 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:32:33,779 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:32:33,779 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:32:33,779 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:32:33,779 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:32:33,780 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:32:33,780 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:32:33,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:32:33,781 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:32:33,781 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:32:33,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:32:33,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:32:33,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:32:33,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:32:33,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:32:33,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:32:33,783 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:32:33,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:32:33,783 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:32:33,783 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:32:33,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:32:33,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:32:33,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:32:33,785 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:32:33,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:32:33,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:32:33,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:32:33,786 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:32:33,787 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:32:33,787 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2020-11-30 00:32:34,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:32:34,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:32:34,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:32:34,176 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:32:34,177 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:32:34,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-11-30 00:32:34,265 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/data/beae9be30/7203329524ab44d8ab508307bf2887d5/FLAGafec341fa [2020-11-30 00:32:34,860 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:32:34,861 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-11-30 00:32:34,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/data/beae9be30/7203329524ab44d8ab508307bf2887d5/FLAGafec341fa [2020-11-30 00:32:35,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/data/beae9be30/7203329524ab44d8ab508307bf2887d5 [2020-11-30 00:32:35,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:32:35,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:32:35,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:32:35,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:32:35,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:32:35,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba2ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35, skipping insertion in model container [2020-11-30 00:32:35,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:32:35,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:32:35,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:32:35,688 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:32:35,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:32:35,824 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:32:35,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35 WrapperNode [2020-11-30 00:32:35,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:32:35,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:32:35,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:32:35,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:32:35,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:32:35,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:32:35,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:32:35,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:32:35,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... [2020-11-30 00:32:35,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:32:35,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:32:35,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:32:35,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:32:35,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:32:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:32:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:32:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:32:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:32:36,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:32:36,611 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:32:36,614 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 00:32:36,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:32:36 BoogieIcfgContainer [2020-11-30 00:32:36,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:32:36,634 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:32:36,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:32:36,641 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:32:36,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:32:36,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:32:35" (1/3) ... [2020-11-30 00:32:36,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33d675e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:32:36, skipping insertion in model container [2020-11-30 00:32:36,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:32:36,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:32:35" (2/3) ... [2020-11-30 00:32:36,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33d675e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:32:36, skipping insertion in model container [2020-11-30 00:32:36,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:32:36,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:32:36" (3/3) ... [2020-11-30 00:32:36,647 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2020-11-30 00:32:36,705 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:32:36,706 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:32:36,706 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:32:36,706 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:32:36,706 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:32:36,706 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:32:36,707 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:32:36,707 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:32:36,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-30 00:32:36,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:32:36,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:36,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:36,755 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:32:36,756 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:32:36,756 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:32:36,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-30 00:32:36,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:32:36,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:36,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:36,759 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:32:36,759 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:32:36,769 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 [2020-11-30 00:32:36,769 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 [2020-11-30 00:32:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-30 00:32:36,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:36,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700970113] [2020-11-30 00:32:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:36,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:36,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:36,945 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-30 00:32:36,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:36,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610552903] [2020-11-30 00:32:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:36,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:36,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:36,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-30 00:32:36,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:36,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194195570] [2020-11-30 00:32:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:37,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:37,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:37,050 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:37,345 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-30 00:32:37,426 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:32:37,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:32:37,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:32:37,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:32:37,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:32:37,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:37,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:32:37,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:32:37,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2020-11-30 00:32:37,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:32:37,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:32:37,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,698 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-30 00:32:37,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:37,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:38,147 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:32:38,155 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:38,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:38,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:38,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:38,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:38,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:38,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:38,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:38,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:38,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:38,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:38,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:38,371 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:38,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:38,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:38,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:38,435 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:38,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:38,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:38,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:38,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:38,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:38,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:38,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:38,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:38,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:38,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:32:38,730 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-30 00:32:38,730 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-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:38,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:32:38,836 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:32:38,836 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:32:38,837 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2020-11-30 00:32:38,899 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 00:32:38,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:32:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:38,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:32:38,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:39,029 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:32:39,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:39,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-30 00:32:39,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2020-11-30 00:32:39,299 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. [2020-11-30 00:32:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:32:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-30 00:32:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-11-30 00:32:39,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 00:32:39,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:39,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:32:39,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:39,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-30 00:32:39,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:39,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2020-11-30 00:32:39,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:32:39,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2020-11-30 00:32:39,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:32:39,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 00:32:39,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-30 00:32:39,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:32:39,335 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:32:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-30 00:32:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-30 00:32:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-30 00:32:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-11-30 00:32:39,374 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:32:39,374 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:32:39,375 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:32:39,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-11-30 00:32:39,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:32:39,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:39,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:39,380 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:32:39,381 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:39,381 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 [2020-11-30 00:32:39,382 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 [2020-11-30 00:32:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-30 00:32:39,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:39,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351392324] [2020-11-30 00:32:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:39,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351392324] [2020-11-30 00:32:39,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:32:39,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:32:39,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845155425] [2020-11-30 00:32:39,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:32:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-11-30 00:32:39,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:39,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656908521] [2020-11-30 00:32:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:39,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656908521] [2020-11-30 00:32:39,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:32:39,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:32:39,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581166658] [2020-11-30 00:32:39,578 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:32:39,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:32:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:32:39,588 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:32:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:39,617 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-11-30 00:32:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:32:39,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-11-30 00:32:39,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:39,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-11-30 00:32:39,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-30 00:32:39,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-30 00:32:39,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-11-30 00:32:39,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:32:39,622 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 00:32:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-11-30 00:32:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-30 00:32:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 00:32:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-11-30 00:32:39,624 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 00:32:39,624 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 00:32:39,625 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:32:39,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-11-30 00:32:39,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:39,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:39,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:39,630 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:32:39,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:32:39,631 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 [2020-11-30 00:32:39,632 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 [2020-11-30 00:32:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-11-30 00:32:39,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:39,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491231286] [2020-11-30 00:32:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:39,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491231286] [2020-11-30 00:32:39,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:32:39,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:32:39,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127226429] [2020-11-30 00:32:39,683 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:32:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2020-11-30 00:32:39,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:39,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948159685] [2020-11-30 00:32:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:39,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:39,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:39,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:39,826 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-30 00:32:39,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:32:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:32:39,891 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-11-30 00:32:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:39,927 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-11-30 00:32:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:32:39,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-11-30 00:32:39,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:39,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-11-30 00:32:39,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-30 00:32:39,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-30 00:32:39,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-11-30 00:32:39,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:32:39,931 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 00:32:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-11-30 00:32:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-11-30 00:32:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 00:32:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-11-30 00:32:39,933 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-11-30 00:32:39,933 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-11-30 00:32:39,934 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:32:39,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-11-30 00:32:39,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:39,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:39,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:39,936 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:39,936 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:32:39,936 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 [2020-11-30 00:32:39,936 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 [2020-11-30 00:32:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-11-30 00:32:39,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:39,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23531114] [2020-11-30 00:32:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:39,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:39,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:40,005 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2020-11-30 00:32:40,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:40,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593963210] [2020-11-30 00:32:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:40,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:40,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:40,065 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2020-11-30 00:32:40,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:40,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111364389] [2020-11-30 00:32:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:40,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111364389] [2020-11-30 00:32:40,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712204503] [2020-11-30 00:32:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:40,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:32:40,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:32:40,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:32:40,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-11-30 00:32:40,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134519377] [2020-11-30 00:32:40,675 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-11-30 00:32:40,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:32:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:32:40,731 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 11 states. [2020-11-30 00:32:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:41,017 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-11-30 00:32:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:32:41,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2020-11-30 00:32:41,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:41,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2020-11-30 00:32:41,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-30 00:32:41,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-30 00:32:41,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-11-30 00:32:41,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:32:41,026 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-30 00:32:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-11-30 00:32:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-30 00:32:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 00:32:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-30 00:32:41,029 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-30 00:32:41,029 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-30 00:32:41,029 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:32:41,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-11-30 00:32:41,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:32:41,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:41,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:41,034 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:41,035 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:32:41,035 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 [2020-11-30 00:32:41,035 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 [2020-11-30 00:32:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-11-30 00:32:41,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:41,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003622846] [2020-11-30 00:32:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,101 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:41,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2020-11-30 00:32:41,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:41,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837008273] [2020-11-30 00:32:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,135 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2020-11-30 00:32:41,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:41,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874516645] [2020-11-30 00:32:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:41,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:41,212 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:41,347 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-30 00:32:41,779 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-11-30 00:32:41,907 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:32:41,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:32:41,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:32:41,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:32:41,908 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:32:41,908 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:41,908 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:32:41,908 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:32:41,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2020-11-30 00:32:41,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:32:41,908 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:32:41,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:41,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:42,193 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-11-30 00:32:42,534 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 00:32:42,934 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:32:42,934 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:42,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:42,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:42,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:42,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:42,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:42,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:42,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:42,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:42,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:43,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:43,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:43,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,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 [2020-11-30 00:32:43,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,382 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:43,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,510 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:43,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:43,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:43,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:43,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:43,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:43,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:43,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:43,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:43,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:43,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:43,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:43,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:43,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:43,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:43,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:43,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:32:43,993 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-30 00:32:43,993 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-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:32:44,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:44,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:32:44,005 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:32:44,005 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 [] [2020-11-30 00:32:44,059 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 00:32:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:44,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:32:44,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:44,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:32:44,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:32:44,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:32:44,134 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 00:32:44,151 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. [2020-11-30 00:32:44,152 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 [2020-11-30 00:32:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:32:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-11-30 00:32:44,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2020-11-30 00:32:44,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:44,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2020-11-30 00:32:44,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:44,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2020-11-30 00:32:44,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:44,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-11-30 00:32:44,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:44,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2020-11-30 00:32:44,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:32:44,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 00:32:44,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-11-30 00:32:44,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:32:44,156 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-30 00:32:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-11-30 00:32:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-30 00:32:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 00:32:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-11-30 00:32:44,158 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-30 00:32:44,158 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-30 00:32:44,158 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:32:44,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-11-30 00:32:44,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:44,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:44,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:44,159 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:44,159 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:44,160 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 [2020-11-30 00:32:44,160 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 [2020-11-30 00:32:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-11-30 00:32:44,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:44,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426533900] [2020-11-30 00:32:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,199 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:44,200 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-30 00:32:44,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:44,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898812398] [2020-11-30 00:32:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-11-30 00:32:44,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:44,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917345862] [2020-11-30 00:32:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:44,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:44,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:44,760 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2020-11-30 00:32:44,894 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-30 00:32:44,897 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:32:44,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:32:44,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:32:44,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:32:44,898 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:32:44,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:44,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:32:44,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:32:44,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2020-11-30 00:32:44,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:32:44,899 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:32:44,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:44,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,139 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-11-30 00:32:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:45,515 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-11-30 00:32:45,799 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:32:45,799 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:45,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:45,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:45,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:45,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:45,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:45,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:45,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:45,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:45,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:45,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:45,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:45,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:45,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:45,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:45,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:45,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:45,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:45,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:45,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:45,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:45,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:45,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:45,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:45,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:45,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:45,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:45,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:45,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:45,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:32:45,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:45,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:45,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:45,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:32:45,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:32:45,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:45,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:45,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:45,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:45,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:45,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:45,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:45,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:46,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:46,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:32:46,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:32:46,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:32:46,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:32:46,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:32:46,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:32:46,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:32:46,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:32:46,170 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-30 00:32:46,170 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-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:46,188 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:32:46,195 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:32:46,195 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:32:46,196 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 [] [2020-11-30 00:32:46,263 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-11-30 00:32:46,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:32:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:46,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:32:46,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:46,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:32:46,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:46,369 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:32:46,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-30 00:32:46,413 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. [2020-11-30 00:32:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:32:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:32:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-11-30 00:32:46,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-30 00:32:46,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:46,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-30 00:32:46,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:46,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-30 00:32:46,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:32:46,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2020-11-30 00:32:46,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:46,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2020-11-30 00:32:46,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:32:46,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:32:46,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-11-30 00:32:46,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:32:46,421 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-11-30 00:32:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-11-30 00:32:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-11-30 00:32:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 00:32:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-11-30 00:32:46,423 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-30 00:32:46,423 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-30 00:32:46,423 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:32:46,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-11-30 00:32:46,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:46,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:46,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:46,425 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:46,425 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:46,425 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 [2020-11-30 00:32:46,425 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 [2020-11-30 00:32:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-11-30 00:32:46,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:46,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619763014] [2020-11-30 00:32:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:32:46,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619763014] [2020-11-30 00:32:46,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421761972] [2020-11-30 00:32:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:46,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:32:46,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:32:46,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:32:46,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-30 00:32:46,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930439607] [2020-11-30 00:32:46,770 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:32:46,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-30 00:32:46,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:46,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924138966] [2020-11-30 00:32:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:46,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:46,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:46,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:46,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:32:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:32:46,904 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-30 00:32:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:47,033 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-11-30 00:32:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:32:47,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-11-30 00:32:47,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:47,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2020-11-30 00:32:47,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:32:47,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:32:47,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-11-30 00:32:47,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:32:47,039 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-30 00:32:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-11-30 00:32:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-30 00:32:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 00:32:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-11-30 00:32:47,042 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-30 00:32:47,042 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-30 00:32:47,042 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:32:47,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-11-30 00:32:47,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:47,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:47,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:47,044 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:47,044 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:47,044 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 [2020-11-30 00:32:47,045 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 [2020-11-30 00:32:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-11-30 00:32:47,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:47,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180945761] [2020-11-30 00:32:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:32:47,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180945761] [2020-11-30 00:32:47,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837597005] [2020-11-30 00:32:47,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:47,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:32:47,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:32:47,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:32:47,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:32:47,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:32:47,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2020-11-30 00:32:47,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114445461] [2020-11-30 00:32:47,444 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:32:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-30 00:32:47,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:47,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428482339] [2020-11-30 00:32:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:47,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:47,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:47,457 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:47,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:47,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 00:32:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-30 00:32:47,583 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-11-30 00:32:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:47,948 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-11-30 00:32:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:32:47,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-11-30 00:32:47,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:47,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2020-11-30 00:32:47,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-30 00:32:47,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 00:32:47,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2020-11-30 00:32:47,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:32:47,952 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2020-11-30 00:32:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2020-11-30 00:32:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2020-11-30 00:32:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 00:32:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-11-30 00:32:47,955 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-30 00:32:47,955 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-30 00:32:47,955 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:32:47,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-11-30 00:32:47,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:47,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:47,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:47,958 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:47,958 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:47,958 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 [2020-11-30 00:32:47,958 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 [2020-11-30 00:32:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-11-30 00:32:47,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:47,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784087719] [2020-11-30 00:32:47,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:47,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:48,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:48,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-30 00:32:48,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:48,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009005419] [2020-11-30 00:32:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:48,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:48,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:48,047 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2020-11-30 00:32:48,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:48,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687045142] [2020-11-30 00:32:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:32:48,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687045142] [2020-11-30 00:32:48,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569143912] [2020-11-30 00:32:48,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74060398-99e1-4338-ace2-4be9f7845cf4/bin/uautomizer/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 [2020-11-30 00:32:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:32:48,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:32:48,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:32:48,707 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 00:32:48,707 INFO L384 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 [2020-11-30 00:32:48,709 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:32:48,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:32:48,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:32:48,713 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-30 00:32:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:32:48,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:32:48,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-11-30 00:32:48,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231452553] [2020-11-30 00:32:48,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:32:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:32:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:32:48,852 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2020-11-30 00:32:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:32:49,247 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-11-30 00:32:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:32:49,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-11-30 00:32:49,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-30 00:32:49,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2020-11-30 00:32:49,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-30 00:32:49,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-30 00:32:49,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2020-11-30 00:32:49,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:32:49,252 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2020-11-30 00:32:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2020-11-30 00:32:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2020-11-30 00:32:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-30 00:32:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-11-30 00:32:49,257 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-30 00:32:49,257 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-30 00:32:49,258 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:32:49,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2020-11-30 00:32:49,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:32:49,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:32:49,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:32:49,260 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:32:49,260 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:32:49,260 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1012#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; 1013#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1014#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; 1015#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; 1016#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1017#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; 1019#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1038#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; 1037#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1036#L528-3 assume !(main_~i~1 < main_~array_size~0); 1024#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; 1025#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1031#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); 1042#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 1022#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1023#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); 1028#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); 1034#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1041#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 1029#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 1030#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1021#L516-3 [2020-11-30 00:32:49,260 INFO L796 eck$LassoCheckResult]: Loop: 1021#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); 1045#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); 1020#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1021#L516-3 [2020-11-30 00:32:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2020-11-30 00:32:49,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:49,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545898696] [2020-11-30 00:32:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,327 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-11-30 00:32:49,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:49,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023452523] [2020-11-30 00:32:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:32:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2020-11-30 00:32:49,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:32:49,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992189383] [2020-11-30 00:32:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:32:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:32:49,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:32:49,464 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:32:50,603 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2020-11-30 00:32:50,959 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-30 00:32:50,971 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:32:50,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:32:50,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:32:50,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:32:50,972 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:32:50,972 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:32:50,972 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:32:50,972 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:32:50,972 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2020-11-30 00:32:50,972 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:32:50,972 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:32:50,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:51,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:51,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:32:51,111 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 00:32:51,115 INFO L168 Benchmark]: Toolchain (without parser) took 15932.33 ms. Allocated memory was 79.7 MB in the beginning and 174.1 MB in the end (delta: 94.4 MB). Free memory was 38.0 MB in the beginning and 102.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,116 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 79.7 MB. Free memory was 56.0 MB in the beginning and 55.9 MB in the end (delta: 107.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:32:51,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.43 ms. Allocated memory is still 96.5 MB. Free memory was 76.3 MB in the beginning and 56.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.81 ms. Allocated memory is still 96.5 MB. Free memory was 56.1 MB in the beginning and 54.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,117 INFO L168 Benchmark]: Boogie Preprocessor took 34.57 ms. Allocated memory is still 96.5 MB. Free memory was 54.2 MB in the beginning and 53.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,118 INFO L168 Benchmark]: RCFGBuilder took 701.65 ms. Allocated memory is still 96.5 MB. Free memory was 52.8 MB in the beginning and 67.6 MB in the end (delta: -14.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,119 INFO L168 Benchmark]: BuchiAutomizer took 14479.67 ms. Allocated memory was 96.5 MB in the beginning and 174.1 MB in the end (delta: 77.6 MB). Free memory was 67.6 MB in the beginning and 102.4 MB in the end (delta: -34.9 MB). Peak memory consumption was 97.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:32:51,122 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.39 ms. Allocated memory is still 79.7 MB. Free memory was 56.0 MB in the beginning and 55.9 MB in the end (delta: 107.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 622.43 ms. Allocated memory is still 96.5 MB. Free memory was 76.3 MB in the beginning and 56.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.81 ms. Allocated memory is still 96.5 MB. Free memory was 56.1 MB in the beginning and 54.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.57 ms. Allocated memory is still 96.5 MB. Free memory was 54.2 MB in the beginning and 53.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 701.65 ms. Allocated memory is still 96.5 MB. Free memory was 52.8 MB in the beginning and 67.6 MB in the end (delta: -14.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14479.67 ms. Allocated memory was 96.5 MB in the beginning and 174.1 MB in the end (delta: 77.6 MB). Free memory was 67.6 MB in the beginning and 102.4 MB in the end (delta: -34.9 MB). Peak memory consumption was 97.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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...