./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/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 82679d367c32c359f0c9c81b27b57deea5682b2b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/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.1.24-cad4683 [2019-10-22 08:55:34,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:34,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:34,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:34,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:34,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:34,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:34,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:34,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:34,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:34,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:34,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:34,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:34,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:34,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:34,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:34,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:34,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:34,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:34,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:34,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:34,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:34,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:34,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:34,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:34,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:34,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:34,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:34,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:34,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:34,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:34,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:34,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:34,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:34,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:34,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:34,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:34,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:34,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:34,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:34,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:34,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:34,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:34,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:34,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:34,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:34,518 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:34,518 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:34,518 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:34,518 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:34,518 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:34,518 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:34,519 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:34,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:34,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:34,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:34,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:34,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:34,520 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:34,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:34,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:34,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:34,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:34,521 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:34,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:34,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:34,522 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:34,522 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:34,522 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/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 -> 82679d367c32c359f0c9c81b27b57deea5682b2b [2019-10-22 08:55:34,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:34,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:34,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:34,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:34,582 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:34,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-10-22 08:55:34,630 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/data/8e59e1c21/0c5e06ff27ea4627afdb219b63358a92/FLAG22c3ba50e [2019-10-22 08:55:35,096 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:35,099 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-10-22 08:55:35,111 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/data/8e59e1c21/0c5e06ff27ea4627afdb219b63358a92/FLAG22c3ba50e [2019-10-22 08:55:35,602 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/data/8e59e1c21/0c5e06ff27ea4627afdb219b63358a92 [2019-10-22 08:55:35,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:35,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:35,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:35,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:35,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:35,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:35" (1/1) ... [2019-10-22 08:55:35,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f764ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:35, skipping insertion in model container [2019-10-22 08:55:35,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:35" (1/1) ... [2019-10-22 08:55:35,621 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:35,657 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:36,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:36,020 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:36,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:36,125 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:36,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36 WrapperNode [2019-10-22 08:55:36,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:36,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:36,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:36,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:36,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:36,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:36,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:36,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:36,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... [2019-10-22 08:55:36,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:36,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:36,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:36,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:36,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/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 [2019-10-22 08:55:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:36,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:36,547 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:36,547 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:55:36,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:36 BoogieIcfgContainer [2019-10-22 08:55:36,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:36,549 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:36,549 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:36,553 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:36,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:36,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:35" (1/3) ... [2019-10-22 08:55:36,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4edb5947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:36, skipping insertion in model container [2019-10-22 08:55:36,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:36,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:36" (2/3) ... [2019-10-22 08:55:36,556 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4edb5947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:36, skipping insertion in model container [2019-10-22 08:55:36,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:36,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:36" (3/3) ... [2019-10-22 08:55:36,557 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-10-22 08:55:36,605 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:36,605 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:36,605 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:36,605 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:36,605 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:36,606 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:36,606 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:36,606 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:36,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:55:36,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:55:36,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:36,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:36,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:36,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:36,643 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:36,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:55:36,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:55:36,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:36,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:36,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:36,645 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:36,650 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 14#L531true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L531-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; 9#L536-3true [2019-10-22 08:55:36,650 INFO L793 eck$LassoCheckResult]: Loop: 9#L536-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; 6#L536-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 9#L536-3true [2019-10-22 08:55:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:55:36,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:36,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200841239] [2019-10-22 08:55:36,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:55:36,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:36,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70602070] [2019-10-22 08:55:36,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:55:36,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:36,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198000330] [2019-10-22 08:55:36,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:36,809 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:36,960 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:36,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:36,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:36,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:36,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:36,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:36,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:36,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:36,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-10-22 08:55:36,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:36,962 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:36,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:36,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:36,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:36,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:37,321 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:37,326 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:37,328 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 [2019-10-22 08:55:37,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:37,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:37,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:37,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,338 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 [2019-10-22 08:55:37,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:37,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:37,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:37,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,343 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 [2019-10-22 08:55:37,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,349 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:37,349 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:37,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,353 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 [2019-10-22 08:55:37,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:37,361 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:37,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,368 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 [2019-10-22 08:55:37,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:37,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:37,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:37,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,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 [2019-10-22 08:55:37,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:37,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:37,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:37,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,378 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 [2019-10-22 08:55:37,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:37,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:37,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:37,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:37,394 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 [2019-10-22 08:55:37,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:37,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:37,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:37,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:37,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:37,398 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:37,462 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:37,542 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:55:37,543 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:55:37,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:37,546 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:37,547 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:37,547 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-10-22 08:55:37,555 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:55:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:37,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:37,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:37,647 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 [2019-10-22 08:55:37,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:55:37,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 7 states. [2019-10-22 08:55:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-10-22 08:55:37,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:55:37,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:37,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:55:37,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:37,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:55:37,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:37,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-10-22 08:55:37,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:55:37,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-10-22 08:55:37,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:55:37,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:55:37,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:55:37,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:37,706 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:55:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:55:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:55:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:55:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:55:37,731 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:55:37,731 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:55:37,731 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:37,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:55:37,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:55:37,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:37,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:37,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:37,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:37,733 INFO L791 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 124#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; 125#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 127#L531-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; 122#L536-3 assume !(main_~i~1 < main_~array_size~0); 123#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 119#L515-3 [2019-10-22 08:55:37,733 INFO L793 eck$LassoCheckResult]: Loop: 119#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 115#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 116#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 118#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 119#L515-3 [2019-10-22 08:55:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:55:37,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:37,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012694588] [2019-10-22 08:55:37,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:37,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012694588] [2019-10-22 08:55:37,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:37,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:37,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917220552] [2019-10-22 08:55:37,800 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-10-22 08:55:37,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:37,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335387748] [2019-10-22 08:55:37,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:37,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335387748] [2019-10-22 08:55:37,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:37,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:37,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632746188] [2019-10-22 08:55:37,831 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:37,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:37,837 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:55:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:37,853 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-10-22 08:55:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:37,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-10-22 08:55:37,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:37,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 08:55:37,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:37,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:37,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 08:55:37,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:37,856 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:55:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 08:55:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:55:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:55:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 08:55:37,858 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:55:37,858 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:55:37,858 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:37,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 08:55:37,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:37,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:37,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:37,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:37,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:37,860 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#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; 162#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 165#L531-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#L536-3 assume !(main_~i~1 < main_~array_size~0); 160#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 156#L515-3 [2019-10-22 08:55:37,860 INFO L793 eck$LassoCheckResult]: Loop: 156#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 152#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 153#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 163#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 166#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 154#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 155#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 156#L515-3 [2019-10-22 08:55:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-10-22 08:55:37,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:37,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91451348] [2019-10-22 08:55:37,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:37,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91451348] [2019-10-22 08:55:37,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:37,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:37,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072571596] [2019-10-22 08:55:37,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-10-22 08:55:37,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:37,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936309671] [2019-10-22 08:55:37,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:37,913 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,037 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-22 08:55:38,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:38,078 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:55:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:38,105 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-10-22 08:55:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:38,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-10-22 08:55:38,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:38,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 08:55:38,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:38,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:38,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 08:55:38,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:38,108 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:55:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 08:55:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 08:55:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:55:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 08:55:38,110 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:55:38,110 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:55:38,110 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:38,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 08:55:38,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:38,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:38,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:38,113 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:38,113 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:38,113 INFO L791 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#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; 200#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L531-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; 197#L536-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; 195#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 196#L536-3 assume !(main_~i~1 < main_~array_size~0); 198#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 194#L515-3 [2019-10-22 08:55:38,113 INFO L793 eck$LassoCheckResult]: Loop: 194#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 190#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 191#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 201#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 204#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 192#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 193#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 194#L515-3 [2019-10-22 08:55:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:55:38,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671124383] [2019-10-22 08:55:38,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-10-22 08:55:38,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796633651] [2019-10-22 08:55:38,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-10-22 08:55:38,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44877790] [2019-10-22 08:55:38,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:38,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44877790] [2019-10-22 08:55:38,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918682369] [2019-10-22 08:55:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:38,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:38,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:38,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:38,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-22 08:55:38,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637079351] [2019-10-22 08:55:38,508 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-22 08:55:38,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:38,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:38,545 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-10-22 08:55:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:38,646 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-10-22 08:55:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:38,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:55:38,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:38,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-10-22 08:55:38,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:38,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:38,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:55:38,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:38,650 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:55:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:55:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:55:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:55:38,652 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:55:38,652 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:55:38,652 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:38,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:55:38,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:38,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:38,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:38,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:38,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:38,654 INFO L791 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#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; 303#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 307#L531-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; 300#L536-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; 298#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 299#L536-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; 301#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 309#L536-3 assume !(main_~i~1 < main_~array_size~0); 304#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 297#L515-3 [2019-10-22 08:55:38,654 INFO L793 eck$LassoCheckResult]: Loop: 297#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 293#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 294#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 305#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 308#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 295#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 296#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 297#L515-3 [2019-10-22 08:55:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-10-22 08:55:38,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844804738] [2019-10-22 08:55:38,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,674 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-10-22 08:55:38,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067195088] [2019-10-22 08:55:38,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-10-22 08:55:38,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:38,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099461505] [2019-10-22 08:55:38,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:38,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:38,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:38,824 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-22 08:55:39,025 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-10-22 08:55:39,078 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:39,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:39,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:39,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:39,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:39,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:39,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:39,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:39,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-10-22 08:55:39,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:39,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:39,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:39,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:39,607 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:39,607 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 [2019-10-22 08:55:39,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:39,608 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:55:39,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:39,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:39,616 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:55:39,616 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:39,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:39,628 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 [2019-10-22 08:55:39,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:39,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:39,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:39,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:39,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:39,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:39,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:39,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:39,635 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 [2019-10-22 08:55:39,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:39,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:39,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:39,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:39,637 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:39,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:39,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:39,651 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 [2019-10-22 08:55:39,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:39,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:39,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:39,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:39,653 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:39,653 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:39,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:39,655 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 [2019-10-22 08:55:39,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:39,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:39,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:39,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:39,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:39,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:39,760 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:39,793 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:39,793 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:55:39,793 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:39,794 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:39,795 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:39,799 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-10-22 08:55:39,808 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:55:39,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:39,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:39,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:39,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:39,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:39,860 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 [2019-10-22 08:55:39,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:55:39,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2019-10-22 08:55:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:55:39,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2019-10-22 08:55:39,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:39,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-10-22 08:55:39,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:39,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2019-10-22 08:55:39,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:39,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-10-22 08:55:39,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:39,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2019-10-22 08:55:39,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:55:39,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:55:39,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-10-22 08:55:39,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:39,887 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-22 08:55:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-10-22 08:55:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 08:55:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:55:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-22 08:55:39,889 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:55:39,889 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:55:39,889 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:39,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-10-22 08:55:39,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:39,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:39,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:39,890 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:39,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:39,890 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 433#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; 434#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 439#L531-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; 431#L536-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; 428#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 429#L536-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; 432#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 441#L536-3 assume !(main_~i~1 < main_~array_size~0); 435#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 430#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 421#L519-3 [2019-10-22 08:55:39,890 INFO L793 eck$LassoCheckResult]: Loop: 421#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 422#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 436#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 421#L519-3 [2019-10-22 08:55:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-10-22 08:55:39,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:39,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231125676] [2019-10-22 08:55:39,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-10-22 08:55:39,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:39,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560154438] [2019-10-22 08:55:39,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-10-22 08:55:39,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:39,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323396760] [2019-10-22 08:55:39,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:39,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:39,950 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:40,196 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-10-22 08:55:40,244 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:40,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:40,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:40,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:40,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:40,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:40,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:40,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:40,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-10-22 08:55:40,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:40,244 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,706 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:40,706 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:40,706 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 [2019-10-22 08:55:40,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,709 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 [2019-10-22 08:55:40,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,711 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 [2019-10-22 08:55:40,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,713 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:40,713 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,715 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 [2019-10-22 08:55:40,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,717 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 [2019-10-22 08:55:40,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,719 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:40,719 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,721 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 [2019-10-22 08:55:40,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,723 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 [2019-10-22 08:55:40,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,724 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,725 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 [2019-10-22 08:55:40,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,727 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:40,727 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,729 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 [2019-10-22 08:55:40,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:40,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:40,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:40,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,732 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 [2019-10-22 08:55:40,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,734 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:40,734 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:40,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,739 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:55:40,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,741 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:55:40,741 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:40,747 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 [2019-10-22 08:55:40,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:40,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:40,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:40,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:40,750 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:40,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:40,816 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:40,839 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:55:40,839 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:55:40,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:40,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:40,840 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:40,840 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-10-22 08:55:40,857 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:55:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:40,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:40,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:40,906 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 [2019-10-22 08:55:40,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:55:40,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 7 states. [2019-10-22 08:55:40,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 08:55:40,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:55:40,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:40,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:55:40,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:40,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:55:40,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:40,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-10-22 08:55:40,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:40,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 28 states and 36 transitions. [2019-10-22 08:55:40,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:55:40,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:55:40,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2019-10-22 08:55:40,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:40,934 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 08:55:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2019-10-22 08:55:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-10-22 08:55:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:55:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-10-22 08:55:40,935 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 08:55:40,935 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 08:55:40,935 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:40,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-10-22 08:55:40,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:40,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:40,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:40,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:40,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:40,936 INFO L791 eck$LassoCheckResult]: Stem: 580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 575#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; 576#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 581#L531-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; 573#L536-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; 570#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 571#L536-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; 574#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 583#L536-3 assume !(main_~i~1 < main_~array_size~0); 577#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 572#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 565#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 566#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 579#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 582#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 567#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 568#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 569#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 563#L519-3 [2019-10-22 08:55:40,937 INFO L793 eck$LassoCheckResult]: Loop: 563#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 564#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 578#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 563#L519-3 [2019-10-22 08:55:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2019-10-22 08:55:40,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742693024] [2019-10-22 08:55:40,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:55:40,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742693024] [2019-10-22 08:55:40,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956349478] [2019-10-22 08:55:40,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_beb66195-4b09-4892-b928-5fda87cfb6b8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:41,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:41,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:41,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-10-22 08:55:41,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430832612] [2019-10-22 08:55:41,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-10-22 08:55:41,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201681911] [2019-10-22 08:55:41,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:41,146 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-10-22 08:55:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,291 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-10-22 08:55:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:55:41,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 58 transitions. [2019-10-22 08:55:41,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:41,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-10-22 08:55:41,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:55:41,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:55:41,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-10-22 08:55:41,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:41,293 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-10-22 08:55:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-10-22 08:55:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-10-22 08:55:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:55:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-22 08:55:41,295 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:55:41,295 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:55:41,295 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:41,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-10-22 08:55:41,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:41,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:41,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:41,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:41,297 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:41,297 INFO L791 eck$LassoCheckResult]: Stem: 730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 724#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; 725#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 731#L531-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; 722#L536-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; 718#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 719#L536-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; 723#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 736#L536-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; 735#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 734#L536-3 assume !(main_~i~1 < main_~array_size~0); 726#L536-4 SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 720#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 721#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 728#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 729#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 713#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 714#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 733#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 732#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 715#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 716#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 717#L515-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 711#L519-3 [2019-10-22 08:55:41,297 INFO L793 eck$LassoCheckResult]: Loop: 711#L519-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 712#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 727#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 711#L519-3 [2019-10-22 08:55:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 2 times [2019-10-22 08:55:41,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645374057] [2019-10-22 08:55:41,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-10-22 08:55:41,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143057894] [2019-10-22 08:55:41,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2019-10-22 08:55:41,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375700021] [2019-10-22 08:55:41,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,363 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,962 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 150 [2019-10-22 08:55:42,059 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:42,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:42,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:42,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:42,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:42,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:42,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:42,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:42,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration8_Lasso [2019-10-22 08:55:42,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:42,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:42,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,137 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) 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:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 08:55:42,140 INFO L168 Benchmark]: Toolchain (without parser) took 6533.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 210.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,140 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:42,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,142 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,142 INFO L168 Benchmark]: RCFGBuilder took 362.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,143 INFO L168 Benchmark]: BuchiAutomizer took 5590.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:42,146 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 518.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5590.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...