./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:03:56,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:03:56,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:03:56,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:03:56,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:03:56,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:03:56,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:03:56,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:03:56,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:03:56,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:03:56,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:03:56,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:03:56,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:03:56,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:03:56,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:03:56,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:03:56,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:03:56,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:03:56,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:03:56,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:03:56,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:03:56,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:03:56,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:03:56,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:03:56,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:03:56,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:03:56,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:03:56,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:03:56,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:03:56,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:03:56,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:03:56,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:03:56,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:03:56,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:03:56,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:03:56,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:03:56,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:03:56,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:03:56,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:03:56,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:03:56,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:03:56,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:03:56,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:03:56,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:03:56,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:03:56,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:03:56,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:03:56,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:03:56,702 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:03:56,702 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:03:56,703 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:03:56,703 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:03:56,703 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:03:56,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:03:56,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:03:56,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:03:56,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:03:56,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:03:56,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:03:56,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:03:56,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:03:56,707 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:03:56,707 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d [2021-12-15 17:03:56,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:03:56,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:03:56,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:03:56,917 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:03:56,917 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:03:56,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2021-12-15 17:03:56,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7327d1ef6/791b96192abe404db3aa8025fe61876c/FLAGfdf576900 [2021-12-15 17:03:57,359 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:03:57,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2021-12-15 17:03:57,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7327d1ef6/791b96192abe404db3aa8025fe61876c/FLAGfdf576900 [2021-12-15 17:03:57,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7327d1ef6/791b96192abe404db3aa8025fe61876c [2021-12-15 17:03:57,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:03:57,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:03:57,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:57,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:03:57,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:03:57,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:57" (1/1) ... [2021-12-15 17:03:57,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a359e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:57, skipping insertion in model container [2021-12-15 17:03:57,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:57" (1/1) ... [2021-12-15 17:03:57,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:03:57,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:03:57,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:57,966 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:03:57,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:58,024 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:03:58,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58 WrapperNode [2021-12-15 17:03:58,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:58,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:58,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:03:58,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:03:58,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,063 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2021-12-15 17:03:58,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:58,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:03:58,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:03:58,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:03:58,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:03:58,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:03:58,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:03:58,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:03:58,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (1/1) ... [2021-12-15 17:03:58,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:58,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:58,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:58,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:03:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:03:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:03:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:03:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:03:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:03:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:03:58,231 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:03:58,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:03:58,354 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:03:58,358 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:03:58,358 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:03:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:58 BoogieIcfgContainer [2021-12-15 17:03:58,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:03:58,360 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:03:58,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:03:58,362 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:03:58,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:58,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:03:57" (1/3) ... [2021-12-15 17:03:58,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513ac8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:58, skipping insertion in model container [2021-12-15 17:03:58,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:58,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:58" (2/3) ... [2021-12-15 17:03:58,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513ac8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:58, skipping insertion in model container [2021-12-15 17:03:58,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:58,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:58" (3/3) ... [2021-12-15 17:03:58,365 INFO L388 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2021-12-15 17:03:58,405 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:03:58,405 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:03:58,406 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:03:58,406 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:03:58,406 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:03:58,406 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:03:58,406 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:03:58,406 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:03:58,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:58,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:58,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:58,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:58,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:03:58,434 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:03:58,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:58,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:58,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:58,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:58,437 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:03:58,441 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11#L566true assume !(main_~array_size~0#1 < 1); 13#L566-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 8#L550-3true [2021-12-15 17:03:58,442 INFO L793 eck$LassoCheckResult]: Loop: 8#L550-3true assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 14#L554-3true assume !true; 10#L554-4true call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 15#L550-2true SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 8#L550-3true [2021-12-15 17:03:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-15 17:03:58,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708967186] [2021-12-15 17:03:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,538 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2021-12-15 17:03:58,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659295384] [2021-12-15 17:03:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:58,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:58,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659295384] [2021-12-15 17:03:58,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659295384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:58,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:58,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:03:58,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370849463] [2021-12-15 17:03:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:58,623 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:03:58,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:03:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:03:58,648 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:58,653 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2021-12-15 17:03:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:03:58,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2021-12-15 17:03:58,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:58,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2021-12-15 17:03:58,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:03:58,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:03:58,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2021-12-15 17:03:58,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:58,665 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-15 17:03:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2021-12-15 17:03:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-15 17:03:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2021-12-15 17:03:58,683 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-15 17:03:58,683 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-15 17:03:58,683 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:03:58,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2021-12-15 17:03:58,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:58,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:58,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:58,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:58,685 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:03:58,685 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 44#L566 assume !(main_~array_size~0#1 < 1); 41#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 42#L550-3 [2021-12-15 17:03:58,685 INFO L793 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 40#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 43#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 45#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 42#L550-3 [2021-12-15 17:03:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2021-12-15 17:03:58,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690490474] [2021-12-15 17:03:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2021-12-15 17:03:58,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294789515] [2021-12-15 17:03:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:58,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:58,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294789515] [2021-12-15 17:03:58,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294789515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:58,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:58,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:03:58,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628616732] [2021-12-15 17:03:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:58,759 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:03:58,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:03:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:03:58,763 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:58,784 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2021-12-15 17:03:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:03:58,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2021-12-15 17:03:58,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-15 17:03:58,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2021-12-15 17:03:58,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-15 17:03:58,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:03:58,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2021-12-15 17:03:58,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:58,791 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-15 17:03:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2021-12-15 17:03:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-15 17:03:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2021-12-15 17:03:58,793 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-15 17:03:58,793 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-15 17:03:58,793 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:03:58,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2021-12-15 17:03:58,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-15 17:03:58,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:58,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:58,794 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:58,794 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:58,794 INFO L791 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 64#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 71#L566 assume !(main_~array_size~0#1 < 1); 68#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 69#L550-3 [2021-12-15 17:03:58,795 INFO L793 eck$LassoCheckResult]: Loop: 69#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 70#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 65#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 66#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 67#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 72#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 73#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 69#L550-3 [2021-12-15 17:03:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2021-12-15 17:03:58,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140386705] [2021-12-15 17:03:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,809 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2021-12-15 17:03:58,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464451129] [2021-12-15 17:03:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2021-12-15 17:03:58,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:58,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519322846] [2021-12-15 17:03:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:58,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:58,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:59,298 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:59,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:59,299 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:59,299 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:59,299 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:59,299 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:59,299 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:59,299 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:59,299 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2021-12-15 17:03:59,299 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:59,300 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:59,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:59,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:59,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:59,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:59,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:59,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:03:59,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:59,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:59,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:59,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:59,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:59,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:59,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:59,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:59,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:59,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:59,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:59,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:59,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:03:59,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:59,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:59,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:59,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:59,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:59,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:59,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:59,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:59,825 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-15 17:03:59,825 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-15 17:03:59,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:59,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:59,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:59,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:03:59,830 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:59,852 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:03:59,852 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:59,853 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_SelectionSort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 4*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a#1.offset >= 0] [2021-12-15 17:03:59,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:59,882 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:03:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:59,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:03:59,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:59,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:03:59,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:00,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-15 17:04:00,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:00,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:00,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 6 states. [2021-12-15 17:04:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2021-12-15 17:04:00,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2021-12-15 17:04:00,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:00,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2021-12-15 17:04:00,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:00,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2021-12-15 17:04:00,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:00,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2021-12-15 17:04:00,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:00,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2021-12-15 17:04:00,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:04:00,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:04:00,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2021-12-15 17:04:00,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:00,216 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-15 17:04:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2021-12-15 17:04:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-12-15 17:04:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2021-12-15 17:04:00,218 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-12-15 17:04:00,218 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-12-15 17:04:00,219 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:04:00,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2021-12-15 17:04:00,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:00,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:00,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:00,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:04:00,220 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:04:00,220 INFO L791 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 185#L566 assume !(main_~array_size~0#1 < 1); 180#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 181#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 177#L554-3 [2021-12-15 17:04:00,220 INFO L793 eck$LassoCheckResult]: Loop: 177#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 173#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 174#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 177#L554-3 [2021-12-15 17:04:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2021-12-15 17:04:00,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:00,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621051501] [2021-12-15 17:04:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:00,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,239 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2021-12-15 17:04:00,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:00,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511288637] [2021-12-15 17:04:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:00,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2021-12-15 17:04:00,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:00,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047152] [2021-12-15 17:04:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:00,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:00,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:00,493 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:00,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:00,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:00,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:00,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:00,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:00,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:00,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:00,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2021-12-15 17:04:00,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:00,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:00,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:00,844 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:00,844 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:00,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:00,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:00,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:04:00,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:00,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:00,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:00,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:00,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:00,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:00,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:00,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:00,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-15 17:04:00,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:00,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:00,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:00,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:04:00,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:00,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:00,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:00,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:00,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:00,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:00,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:00,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:00,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-15 17:04:00,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:00,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:00,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:04:00,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:00,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:00,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:00,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:00,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:00,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:00,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:00,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:01,037 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-15 17:04:01,037 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 27 variables to zero. [2021-12-15 17:04:01,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:01,049 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:01,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:04:01,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:01,072 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:01,072 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:01,072 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2, ULTIMATE.start_SelectionSort_~a#1.offset, ULTIMATE.start_SelectionSort_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2 - 1*ULTIMATE.start_SelectionSort_~a#1.offset - 4*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2021-12-15 17:04:01,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:01,096 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:04:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:01,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:01,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:01,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:01,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:01,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:01,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:01,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 47 transitions. Complement of second has 7 states. [2021-12-15 17:04:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-15 17:04:01,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-15 17:04:01,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:01,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2021-12-15 17:04:01,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:01,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-15 17:04:01,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:01,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2021-12-15 17:04:01,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:01,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2021-12-15 17:04:01,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:04:01,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:04:01,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-15 17:04:01,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:01,158 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-15 17:04:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-15 17:04:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2021-12-15 17:04:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-15 17:04:01,160 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-15 17:04:01,160 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-15 17:04:01,160 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:04:01,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-15 17:04:01,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:01,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:01,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:01,161 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:01,161 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:04:01,161 INFO L791 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 297#L566 assume !(main_~array_size~0#1 < 1); 292#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 293#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 291#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 287#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 288#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 290#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 295#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 296#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 294#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 289#L554-3 [2021-12-15 17:04:01,161 INFO L793 eck$LassoCheckResult]: Loop: 289#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 285#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 286#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 289#L554-3 [2021-12-15 17:04:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2021-12-15 17:04:01,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:01,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71453519] [2021-12-15 17:04:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:01,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:01,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71453519] [2021-12-15 17:04:01,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71453519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:01,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799832174] [2021-12-15 17:04:01,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:01,194 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:01,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 17:04:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:01,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:04:01,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:01,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:01,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799832174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:01,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:01,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2021-12-15 17:04:01,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820000114] [2021-12-15 17:04:01,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:01,289 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:04:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2021-12-15 17:04:01,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550867608] [2021-12-15 17:04:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,301 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:01,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 17:04:01,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 17:04:01,344 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:01,390 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-15 17:04:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:04:01,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-12-15 17:04:01,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:01,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2021-12-15 17:04:01,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:04:01,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:04:01,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2021-12-15 17:04:01,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:01,398 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-15 17:04:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2021-12-15 17:04:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2021-12-15 17:04:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-12-15 17:04:01,404 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-15 17:04:01,404 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-15 17:04:01,404 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:04:01,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-12-15 17:04:01,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:04:01,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:01,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:01,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:01,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:04:01,407 INFO L791 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 421#L566 assume !(main_~array_size~0#1 < 1); 415#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 416#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 417#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 423#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 413#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 414#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 410#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 411#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 422#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 419#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 420#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 418#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 412#L554-3 [2021-12-15 17:04:01,407 INFO L793 eck$LassoCheckResult]: Loop: 412#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 408#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 409#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 412#L554-3 [2021-12-15 17:04:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2021-12-15 17:04:01,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610842785] [2021-12-15 17:04:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,457 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2021-12-15 17:04:01,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:01,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883385553] [2021-12-15 17:04:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,478 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:01,478 INFO L85 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2021-12-15 17:04:01,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:01,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13838156] [2021-12-15 17:04:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:01,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:01,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:01,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:01,931 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:01,931 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:01,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:01,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:01,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:01,932 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:01,932 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:01,932 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:01,932 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2021-12-15 17:04:01,932 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:01,932 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:01,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:01,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:02,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:02,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:02,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,325 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:04:02,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:02,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:02,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:02,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:02,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:04:02,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:02,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:02,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:02,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,399 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:04:02,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:02,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:02,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:02,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,464 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:04:02,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:02,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:02,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:02,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:04:02,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:02,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:02,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:02,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:02,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:04:02,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:02,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:02,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:02,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:02,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:02,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:02,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:02,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:02,586 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-15 17:04:02,586 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 28 variables to zero. [2021-12-15 17:04:02,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:02,587 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:04:02,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:04:02,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:02,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:02,595 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:02,595 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~j~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2021-12-15 17:04:02,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:02,632 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:04:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:02,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:02,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 48 transitions. Complement of second has 7 states. [2021-12-15 17:04:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-15 17:04:02,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:04:02,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:02,714 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:04:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:02,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:02,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 48 transitions. Complement of second has 7 states. [2021-12-15 17:04:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-15 17:04:02,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:04:02,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:02,797 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:04:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:02,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:02,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:02,855 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:02,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 39 transitions. Complement of second has 6 states. [2021-12-15 17:04:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2021-12-15 17:04:02,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:04:02,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:02,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-15 17:04:02,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:02,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2021-12-15 17:04:02,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:02,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2021-12-15 17:04:02,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:04:02,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2021-12-15 17:04:02,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:04:02,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:04:02,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:04:02,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:02,882 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:04:02,882 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:04:02,882 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:04:02,882 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:04:02,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:04:02,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:04:02,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:04:02,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:04:02 BoogieIcfgContainer [2021-12-15 17:04:02,888 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:04:02,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:04:02,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:04:02,890 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:04:02,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:58" (3/4) ... [2021-12-15 17:04:02,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:04:02,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:04:02,897 INFO L158 Benchmark]: Toolchain (without parser) took 5150.90ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 73.3MB in the beginning and 79.2MB in the end (delta: -5.9MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2021-12-15 17:04:02,900 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:04:02,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.55ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 72.6MB in the end (delta: 404.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:04:02,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.45ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:04:02,901 INFO L158 Benchmark]: Boogie Preprocessor took 35.39ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 69.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:04:02,902 INFO L158 Benchmark]: RCFGBuilder took 258.93ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 60.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:04:02,904 INFO L158 Benchmark]: BuchiAutomizer took 4528.53ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 79.2MB in the end (delta: -19.4MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2021-12-15 17:04:02,904 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 148.9MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:04:02,905 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.55ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 72.6MB in the end (delta: 404.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.45ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.39ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 69.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 258.93ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 60.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4528.53ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 79.2MB in the end (delta: -19.4MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 148.9MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 83 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax110 hnf99 lsp87 ukn78 mio100 lsp66 div100 bol100 ite100 ukn100 eq174 hnf91 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 17:04:02,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:03,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:03,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE