./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:54:09,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:54:09,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:54:09,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:54:09,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:54:09,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:54:09,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:54:09,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:54:09,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:54:09,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:54:09,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:54:09,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:54:09,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:54:09,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:54:09,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:54:09,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:54:09,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:54:09,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:54:09,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:54:09,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:54:09,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:54:09,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:54:09,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:54:09,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:54:09,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:54:09,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:54:09,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:54:09,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:54:09,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:54:09,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:54:09,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:54:09,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:54:09,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:54:09,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:54:09,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:54:09,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:54:09,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:54:09,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:54:09,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:54:09,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:54:09,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:54:09,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:54:09,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:54:09,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:54:09,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:54:09,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:54:09,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:54:09,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:54:09,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:54:09,230 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:54:09,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:54:09,230 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:54:09,231 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:54:09,231 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:54:09,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:54:09,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:54:09,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:54:09,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:54:09,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:54:09,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:54:09,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:54:09,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:54:09,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:54:09,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:54:09,235 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:54:09,235 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2022-07-13 04:54:09,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:54:09,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:54:09,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:54:09,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:54:09,417 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:54:09,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2022-07-13 04:54:09,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce653ac2f/89f9c78762804c7abc512a511552260a/FLAGba9d3f1f0 [2022-07-13 04:54:09,859 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:54:09,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2022-07-13 04:54:09,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce653ac2f/89f9c78762804c7abc512a511552260a/FLAGba9d3f1f0 [2022-07-13 04:54:09,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce653ac2f/89f9c78762804c7abc512a511552260a [2022-07-13 04:54:09,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:54:09,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:54:09,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:09,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:54:09,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:54:09,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:09" (1/1) ... [2022-07-13 04:54:09,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd29bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:09, skipping insertion in model container [2022-07-13 04:54:09,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:09" (1/1) ... [2022-07-13 04:54:09,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:54:09,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:54:10,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:10,125 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:54:10,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:10,164 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:54:10,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10 WrapperNode [2022-07-13 04:54:10,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:10,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:10,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:54:10,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:54:10,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,197 INFO L137 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2022-07-13 04:54:10,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:10,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:54:10,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:54:10,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:54:10,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:54:10,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:54:10,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:54:10,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:54:10,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (1/1) ... [2022-07-13 04:54:10,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:10,253 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) [2022-07-13 04:54:10,260 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 [2022-07-13 04:54:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:54:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:54:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:54:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:54:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:54:10,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:54:10,338 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:54:10,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:54:10,433 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:54:10,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:54:10,437 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 04:54:10,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:10 BoogieIcfgContainer [2022-07-13 04:54:10,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:54:10,447 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:54:10,447 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:54:10,449 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:54:10,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:10,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:54:09" (1/3) ... [2022-07-13 04:54:10,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e8aa319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:10, skipping insertion in model container [2022-07-13 04:54:10,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:10,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:10" (2/3) ... [2022-07-13 04:54:10,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e8aa319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:10, skipping insertion in model container [2022-07-13 04:54:10,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:10,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:10" (3/3) ... [2022-07-13 04:54:10,452 INFO L354 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2022-07-13 04:54:10,503 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:54:10,504 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:54:10,504 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:54:10,504 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:54:10,504 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:54:10,504 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:54:10,504 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:54:10,504 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:54:10,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) [2022-07-13 04:54:10,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-13 04:54:10,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:10,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:10,529 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:54:10,536 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:10,537 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:54:10,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) [2022-07-13 04:54:10,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-13 04:54:10,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:10,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:10,539 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:54:10,540 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:10,544 INFO L752 eck$LassoCheckResult]: Stem: 3#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 10#L531true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14#L531-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;main_~i~1#1 := 0; 13#L536-3true [2022-07-13 04:54:10,545 INFO L754 eck$LassoCheckResult]: Loop: 13#L536-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4#L536-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13#L536-3true [2022-07-13 04:54:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-13 04:54:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:10,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964923355] [2022-07-13 04:54:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-07-13 04:54:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:10,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952298511] [2022-07-13 04:54:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:10,722 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-07-13 04:54:10,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:10,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133537410] [2022-07-13 04:54:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:10,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:10,979 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:10,979 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:10,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:10,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:10,980 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:10,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:10,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:10,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:10,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2022-07-13 04:54:10,981 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:10,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:10,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:10,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:11,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:11,351 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:11,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,359 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) [2022-07-13 04:54:11,366 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 [2022-07-13 04:54:11,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:11,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:11,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:11,378 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 [2022-07-13 04:54:11,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 04:54:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,414 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) [2022-07-13 04:54:11,415 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 [2022-07-13 04:54:11,416 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 [2022-07-13 04:54:11,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,469 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 [2022-07-13 04:54:11,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,470 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) [2022-07-13 04:54:11,471 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 [2022-07-13 04:54:11,473 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 [2022-07-13 04:54:11,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:11,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:11,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:11,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,511 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 [2022-07-13 04:54:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,512 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) [2022-07-13 04:54:11,513 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 [2022-07-13 04:54:11,514 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 [2022-07-13 04:54:11,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,541 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 [2022-07-13 04:54:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,543 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) [2022-07-13 04:54:11,543 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 [2022-07-13 04:54:11,545 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 [2022-07-13 04:54:11,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:11,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,599 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) [2022-07-13 04:54:11,612 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 [2022-07-13 04:54:11,613 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 [2022-07-13 04:54:11,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:11,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:11,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:11,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,650 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 [2022-07-13 04:54:11,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,651 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) [2022-07-13 04:54:11,652 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 [2022-07-13 04:54:11,654 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 [2022-07-13 04:54:11,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,694 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 [2022-07-13 04:54:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,695 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2022-07-13 04:54:11,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:54:11,697 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 [2022-07-13 04:54:11,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,728 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) [2022-07-13 04:54:11,729 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 [2022-07-13 04:54:11,730 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 [2022-07-13 04:54:11,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:11,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:11,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:11,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:11,762 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 [2022-07-13 04:54:11,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,763 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) [2022-07-13 04:54:11,764 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 [2022-07-13 04:54:11,765 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 [2022-07-13 04:54:11,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:11,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:11,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:11,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:11,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:11,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:11,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:11,860 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-13 04:54:11,860 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-13 04:54:11,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:11,863 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) [2022-07-13 04:54:11,864 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 [2022-07-13 04:54:11,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:11,886 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:54:11,886 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:11,887 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2022-07-13 04:54:11,910 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 [2022-07-13 04:54:11,919 INFO L293 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-07-13 04:54:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:11,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:54:11,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:11,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:54:11,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:12,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-13 04:54:12,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 04:54:12,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 38 states and 56 transitions. Complement of second has 9 states. [2022-07-13 04:54:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:54:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 04:54:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-07-13 04:54:12,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 04:54:12,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:12,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-13 04:54:12,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:12,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-13 04:54:12,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:12,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2022-07-13 04:54:12,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 04:54:12,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 14 states and 19 transitions. [2022-07-13 04:54:12,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 04:54:12,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-13 04:54:12,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-07-13 04:54:12,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:12,097 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 04:54:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-07-13 04:54:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-13 04:54:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) 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) [2022-07-13 04:54:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-13 04:54:12,112 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 04:54:12,112 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 04:54:12,112 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:54:12,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-13 04:54:12,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 04:54:12,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:12,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:12,112 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,113 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:54:12,113 INFO L752 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 126#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 134#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 135#L531-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;main_~i~1#1 := 0; 138#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 129#L536-4 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; 130#L515-3 [2022-07-13 04:54:12,113 INFO L754 eck$LassoCheckResult]: Loop: 130#L515-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; 131#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 136#L519-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); 132#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 130#L515-3 [2022-07-13 04:54:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-07-13 04:54:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749488852] [2022-07-13 04:54:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:12,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749488852] [2022-07-13 04:54:12,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749488852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:12,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:12,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:54:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737386594] [2022-07-13 04:54:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:12,152 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:54:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2022-07-13 04:54:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326995519] [2022-07-13 04:54:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326995519] [2022-07-13 04:54:12,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326995519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:12,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:12,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:54:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910611530] [2022-07-13 04:54:12,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:12,167 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:54:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:54:12,169 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 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) [2022-07-13 04:54:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:12,178 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-07-13 04:54:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:54:12,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2022-07-13 04:54:12,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2022-07-13 04:54:12,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:54:12,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 04:54:12,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-07-13 04:54:12,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:12,180 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 04:54:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-07-13 04:54:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 04:54:12,181 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) [2022-07-13 04:54:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-07-13 04:54:12,181 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 04:54:12,181 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 04:54:12,181 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:54:12,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-07-13 04:54:12,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:12,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:12,182 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,182 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,182 INFO L752 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 172#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 173#L531-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;main_~i~1#1 := 0; 175#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 166#L536-4 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; 167#L515-3 [2022-07-13 04:54:12,182 INFO L754 eck$LassoCheckResult]: Loop: 167#L515-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; 169#L519-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); 174#L521 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; 170#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 171#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 176#L519-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); 168#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 167#L515-3 [2022-07-13 04:54:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2022-07-13 04:54:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198226273] [2022-07-13 04:54:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:12,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198226273] [2022-07-13 04:54:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198226273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:12,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:12,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:54:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253796335] [2022-07-13 04:54:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:12,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:54:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2022-07-13 04:54:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081282349] [2022-07-13 04:54:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:12,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:54:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:54:12,334 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 04:54:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:12,354 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-07-13 04:54:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:54:12,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2022-07-13 04:54:12,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2022-07-13 04:54:12,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:54:12,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 04:54:12,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-07-13 04:54:12,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:12,360 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-13 04:54:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-07-13 04:54:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-13 04:54:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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) [2022-07-13 04:54:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 04:54:12,363 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 04:54:12,363 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 04:54:12,364 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:54:12,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-07-13 04:54:12,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:12,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:12,365 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,366 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,366 INFO L752 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 201#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 210#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 211#L531-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;main_~i~1#1 := 0; 213#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 202#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 203#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 204#L536-4 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; 205#L515-3 [2022-07-13 04:54:12,366 INFO L754 eck$LassoCheckResult]: Loop: 205#L515-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; 206#L519-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); 212#L521 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; 208#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 209#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 214#L519-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); 207#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 205#L515-3 [2022-07-13 04:54:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-07-13 04:54:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758689807] [2022-07-13 04:54:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2022-07-13 04:54:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161353570] [2022-07-13 04:54:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2022-07-13 04:54:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440770457] [2022-07-13 04:54:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:12,492 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 [2022-07-13 04:54:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:54:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440770457] [2022-07-13 04:54:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440770457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:54:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467697646] [2022-07-13 04:54:12,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:54:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:12,519 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:54:12,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 04:54:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:12,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 04:54:12,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:54:12,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:54:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:54:12,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467697646] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:54:12,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:54:12,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-13 04:54:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286024909] [2022-07-13 04:54:12,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:54:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 04:54:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 04:54:12,731 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) [2022-07-13 04:54:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:12,794 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-13 04:54:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 04:54:12,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2022-07-13 04:54:12,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2022-07-13 04:54:12,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:54:12,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 04:54:12,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-07-13 04:54:12,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:12,799 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 04:54:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-07-13 04:54:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-13 04:54:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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) [2022-07-13 04:54:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 04:54:12,800 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 04:54:12,800 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 04:54:12,800 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:54:12,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-13 04:54:12,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:12,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:12,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:12,801 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,801 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:12,801 INFO L752 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 347#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 356#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 357#L531-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;main_~i~1#1 := 0; 359#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 360#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 361#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 348#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 349#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 350#L536-4 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; 351#L515-3 [2022-07-13 04:54:12,801 INFO L754 eck$LassoCheckResult]: Loop: 351#L515-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; 352#L519-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); 358#L521 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; 354#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 355#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 362#L519-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); 353#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 351#L515-3 [2022-07-13 04:54:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2022-07-13 04:54:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738828215] [2022-07-13 04:54:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2022-07-13 04:54:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395270424] [2022-07-13 04:54:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2022-07-13 04:54:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:12,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837416254] [2022-07-13 04:54:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:12,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:13,208 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:13,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:13,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:13,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:13,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:13,208 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:13,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:13,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2022-07-13 04:54:13,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:13,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:13,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:13,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:13,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:13,757 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) [2022-07-13 04:54:13,758 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 [2022-07-13 04:54:13,759 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 [2022-07-13 04:54:13,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:13,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:13,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:13,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:13,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:13,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:13,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:13,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:13,783 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 [2022-07-13 04:54:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:13,784 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) [2022-07-13 04:54:13,785 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 [2022-07-13 04:54:13,786 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 [2022-07-13 04:54:13,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:13,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:13,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:13,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:13,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:13,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:13,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:13,830 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 [2022-07-13 04:54:13,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:13,831 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) [2022-07-13 04:54:13,832 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 [2022-07-13 04:54:13,833 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 [2022-07-13 04:54:13,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:13,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:13,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:13,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:13,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:13,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:13,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:13,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:13,859 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 [2022-07-13 04:54:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:13,860 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2022-07-13 04:54:13,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:54:13,868 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 [2022-07-13 04:54:13,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:13,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:13,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:13,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:13,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:13,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:13,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:13,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:13,919 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2022-07-13 04:54:13,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:54:13,955 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 [2022-07-13 04:54:13,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:13,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:13,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:13,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:13,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:13,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:13,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:14,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:14,008 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2022-07-13 04:54:14,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 04:54:14,010 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 [2022-07-13 04:54:14,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:14,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:14,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:14,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:14,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:14,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:14,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:14,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:14,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:14,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:14,062 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2022-07-13 04:54:14,077 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 [2022-07-13 04:54:14,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:14,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:14,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:14,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:14,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 04:54:14,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:14,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:14,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:14,140 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-13 04:54:14,140 INFO L444 ModelExtractionUtils]: 29 out of 43 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 04:54:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:14,143 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2022-07-13 04:54:14,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 04:54:14,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:14,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:54:14,171 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:14,171 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~i~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [] [2022-07-13 04:54:14,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:14,201 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-13 04:54:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:14,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:54:14,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:14,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:54:14,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:54:14,275 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 [2022-07-13 04:54:14,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 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) [2022-07-13 04:54:14,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. 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 24 states and 30 transitions. Complement of second has 4 states. [2022-07-13 04:54:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 04:54:14,292 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) [2022-07-13 04:54:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-07-13 04:54:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2022-07-13 04:54:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2022-07-13 04:54:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2022-07-13 04:54:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:14,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2022-07-13 04:54:14,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:54:14,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2022-07-13 04:54:14,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 04:54:14,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 04:54:14,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2022-07-13 04:54:14,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:54:14,296 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-07-13 04:54:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2022-07-13 04:54:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-13 04:54:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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) [2022-07-13 04:54:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-13 04:54:14,297 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 04:54:14,297 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 04:54:14,297 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:54:14,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-07-13 04:54:14,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:54:14,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:14,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:14,298 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:14,298 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:54:14,299 INFO L752 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 483#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 495#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 496#L531-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;main_~i~1#1 := 0; 499#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 484#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 485#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 500#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 502#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 486#L536-4 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; 487#L515-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; 489#L519-3 [2022-07-13 04:54:14,299 INFO L754 eck$LassoCheckResult]: Loop: 489#L519-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); 497#L521 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; 492#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 489#L519-3 [2022-07-13 04:54:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2022-07-13 04:54:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101130281] [2022-07-13 04:54:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2022-07-13 04:54:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:14,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584527357] [2022-07-13 04:54:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2022-07-13 04:54:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:14,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865732839] [2022-07-13 04:54:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:14,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:14,577 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:14,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:14,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:14,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:14,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:14,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:14,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:14,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:14,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2022-07-13 04:54:14,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:14,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:14,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:14,815 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:54:14,818 INFO L158 Benchmark]: Toolchain (without parser) took 4933.17ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 64.7MB in the beginning and 116.5MB in the end (delta: -51.9MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2022-07-13 04:54:14,818 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:14,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.73ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 68.4MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 04:54:14,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 66.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:14,819 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 65.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:14,819 INFO L158 Benchmark]: RCFGBuilder took 212.54ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 54.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:54:14,820 INFO L158 Benchmark]: BuchiAutomizer took 4369.75ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 54.5MB in the beginning and 116.5MB in the end (delta: -62.0MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2022-07-13 04:54:14,827 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.14ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.73ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 68.4MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 66.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 65.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 212.54ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 54.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4369.75ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 54.5MB in the beginning and 116.5MB in the end (delta: -62.0MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:54:14,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:15,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null