./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/selectionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:25:47,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:25:47,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:25:47,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:25:47,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:25:47,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:25:47,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:25:47,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:25:47,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:25:47,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:25:47,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:25:47,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:25:47,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:25:47,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:25:47,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:25:47,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:25:47,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:25:47,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:25:47,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:25:47,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:25:47,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:25:47,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:25:47,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:25:47,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:25:47,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:25:47,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:25:47,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:25:47,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:25:47,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:25:47,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:25:47,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:25:47,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:25:47,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:25:47,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:25:47,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:25:47,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:25:47,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:25:47,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:25:47,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:25:47,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:25:47,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:25:47,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:25:47,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:25:47,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:25:47,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:25:47,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:25:47,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:25:47,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:25:47,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:25:47,242 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:25:47,242 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:25:47,242 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:25:47,243 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:25:47,243 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:25:47,243 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:25:47,244 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:25:47,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:25:47,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:25:47,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:25:47,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:25:47,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:25:47,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:25:47,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:25:47,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:25:47,245 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:25:47,246 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:25:47,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:25:47,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:25:47,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:25:47,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:25:47,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:25:47,247 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:25:47,248 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 [2022-07-13 03:25:47,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:25:47,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:25:47,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:25:47,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:25:47,508 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:25:47,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2022-07-13 03:25:47,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6f9ef5f/70400910139b40d1bbad88542cf0db30/FLAG9ee4f4b50 [2022-07-13 03:25:47,962 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:25:47,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2022-07-13 03:25:47,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6f9ef5f/70400910139b40d1bbad88542cf0db30/FLAG9ee4f4b50 [2022-07-13 03:25:48,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6f9ef5f/70400910139b40d1bbad88542cf0db30 [2022-07-13 03:25:48,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:25:48,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:25:48,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:25:48,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:25:48,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:25:48,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778c91b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48, skipping insertion in model container [2022-07-13 03:25:48,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:25:48,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:25:48,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:25:48,542 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:25:48,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:25:48,572 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:25:48,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48 WrapperNode [2022-07-13 03:25:48,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:25:48,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:25:48,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:25:48,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:25:48,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,596 INFO L137 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-07-13 03:25:48,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:25:48,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:25:48,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:25:48,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:25:48,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:25:48,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:25:48,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:25:48,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:25:48,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (1/1) ... [2022-07-13 03:25:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:48,651 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 03:25:48,653 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 03:25:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:25:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 03:25:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:25:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:25:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:25:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2022-07-13 03:25:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2022-07-13 03:25:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:25:48,741 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:25:48,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:25:48,877 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:25:48,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:25:48,886 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:25:48,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:25:48 BoogieIcfgContainer [2022-07-13 03:25:48,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:25:48,888 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:25:48,888 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:25:48,891 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:25:48,892 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:48,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:25:48" (1/3) ... [2022-07-13 03:25:48,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e68321c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:25:48, skipping insertion in model container [2022-07-13 03:25:48,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:48,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:48" (2/3) ... [2022-07-13 03:25:48,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e68321c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:25:48, skipping insertion in model container [2022-07-13 03:25:48,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:48,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:25:48" (3/3) ... [2022-07-13 03:25:48,895 INFO L354 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2022-07-13 03:25:48,953 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:25:48,954 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:25:48,954 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:25:48,954 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:25:48,954 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:25:48,954 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:25:48,954 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:25:48,955 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:25:48,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:25:48,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 03:25:48,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:48,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:48,979 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:25:48,979 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:48,979 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:25:48,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:25:48,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 03:25:48,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:48,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:48,982 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:25:48,982 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:48,986 INFO L752 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 9#L31true assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 12#L36-3true [2022-07-13 03:25:48,987 INFO L754 eck$LassoCheckResult]: Loop: 12#L36-3true assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 13#L36-2true main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12#L36-3true [2022-07-13 03:25:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-13 03:25:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:48,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863057995] [2022-07-13 03:25:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2022-07-13 03:25:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:49,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211198644] [2022-07-13 03:25:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2022-07-13 03:25:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:49,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147623124] [2022-07-13 03:25:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,189 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:49,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:49,429 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:49,430 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:49,430 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:49,430 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:49,430 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:49,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,431 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:49,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:49,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2022-07-13 03:25:49,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:49,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:49,446 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 03:25:49,452 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 03:25:49,454 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 03:25:49,456 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 03:25:49,458 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 03:25:49,535 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 03:25:49,537 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 03:25:49,540 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 03:25:49,686 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:25:49,690 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:25:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,699 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 03:25:49,706 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 03:25:49,707 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 03:25:49,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:49,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:49,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:49,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:49,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:49,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:49,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:49,753 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 03:25:49,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,764 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 03:25:49,767 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 03:25:49,768 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 03:25:49,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:49,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:49,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:49,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:49,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:49,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:49,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:49,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:49,824 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 03:25:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,826 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 03:25:49,837 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 03:25:49,838 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 03:25:49,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:49,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:49,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:49,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:49,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:49,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:49,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:49,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:49,862 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 03:25:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,864 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 03:25:49,865 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 03:25:49,866 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 03:25:49,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:49,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:49,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:49,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:49,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:49,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:49,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:49,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:49,891 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 03:25:49,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,893 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 03:25:49,893 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 03:25:49,895 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 03:25:49,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:49,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:49,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:49,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:49,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:49,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:49,930 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:25:49,945 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-13 03:25:49,945 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 03:25:49,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:49,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:49,952 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 03:25:49,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:25:49,974 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 03:25:49,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:25:49,977 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:25:49,978 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-13 03:25:50,019 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 03:25:50,026 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-13 03:25:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:25:50,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:50,089 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 03:25:50,115 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 03:25:50,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 03:25:50,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 39 states and 53 transitions. Complement of second has 9 states. [2022-07-13 03:25:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:25:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 03:25:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-07-13 03:25:50,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-13 03:25:50,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:50,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 03:25:50,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:50,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-13 03:25:50,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:50,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2022-07-13 03:25:50,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:25:50,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2022-07-13 03:25:50,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:25:50,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-13 03:25:50,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-07-13 03:25:50,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:50,189 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 03:25:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-07-13 03:25:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-13 03:25:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-13 03:25:50,211 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 03:25:50,211 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 03:25:50,211 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:25:50,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-13 03:25:50,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:25:50,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:50,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:50,214 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:25:50,214 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:25:50,215 INFO L752 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 116#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 117#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 107#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 110#selectionSortENTRY [2022-07-13 03:25:50,215 INFO L754 eck$LassoCheckResult]: Loop: 110#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 111#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 109#L14-3 assume !(~index~0 < ~size); 114#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 108#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 110#selectionSortENTRY [2022-07-13 03:25:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2022-07-13 03:25:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023721635] [2022-07-13 03:25:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,265 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 03:25:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023721635] [2022-07-13 03:25:50,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023721635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:25:50,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:25:50,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:25:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867278627] [2022-07-13 03:25:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:25:50,269 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:25:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2022-07-13 03:25:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793678801] [2022-07-13 03:25:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,298 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 03:25:50,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:50,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793678801] [2022-07-13 03:25:50,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793678801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:25:50,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:25:50,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:25:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438657110] [2022-07-13 03:25:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:25:50,303 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:25:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:50,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:25:50,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:25:50,307 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), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:50,323 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-13 03:25:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:25:50,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-13 03:25:50,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:50,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 03:25:50,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:25:50,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:25:50,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-07-13 03:25:50,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:50,326 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:25:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-07-13 03:25:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 03:25:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 03:25:50,328 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:25:50,328 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:25:50,328 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:25:50,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-07-13 03:25:50,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:50,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:50,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:50,334 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:25:50,335 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:50,336 INFO L752 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 152#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 153#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 143#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 142#selectionSortENTRY [2022-07-13 03:25:50,336 INFO L754 eck$LassoCheckResult]: Loop: 142#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 145#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 150#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 146#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 147#L14-3 assume !(~index~0 < ~size); 154#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 144#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 142#selectionSortENTRY [2022-07-13 03:25:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2022-07-13 03:25:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854076355] [2022-07-13 03:25:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,357 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 03:25:50,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:50,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854076355] [2022-07-13 03:25:50,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854076355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:25:50,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:25:50,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:25:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356819784] [2022-07-13 03:25:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:25:50,358 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:25:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2022-07-13 03:25:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584875174] [2022-07-13 03:25:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:50,604 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 03:25:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:25:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:25:50,835 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:50,843 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-07-13 03:25:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:25:50,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-07-13 03:25:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:50,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2022-07-13 03:25:50,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:25:50,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:25:50,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-13 03:25:50,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:50,846 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-13 03:25:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-13 03:25:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-13 03:25:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-13 03:25:50,848 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:25:50,848 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:25:50,848 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:25:50,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-13 03:25:50,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:50,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:50,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:50,849 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:50,849 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:50,849 INFO L752 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 189#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 190#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 192#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 193#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 181#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 179#selectionSortENTRY [2022-07-13 03:25:50,849 INFO L754 eck$LassoCheckResult]: Loop: 179#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 182#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 187#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 188#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 183#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 184#L14-3 assume !(~index~0 < ~size); 191#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 180#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 179#selectionSortENTRY [2022-07-13 03:25:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2022-07-13 03:25:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867904716] [2022-07-13 03:25:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2022-07-13 03:25:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571258044] [2022-07-13 03:25:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:50,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2022-07-13 03:25:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:50,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122401173] [2022-07-13 03:25:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:50,964 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 03:25:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:50,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122401173] [2022-07-13 03:25:50,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122401173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319287921] [2022-07-13 03:25:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:50,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:50,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:50,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 03:25:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:51,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:25:51,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:51,080 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 03:25:51,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:51,117 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 03:25:51,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319287921] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:51,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:51,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-07-13 03:25:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950234826] [2022-07-13 03:25:51,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 03:25:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-13 03:25:51,450 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:51,521 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-13 03:25:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 03:25:51,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2022-07-13 03:25:51,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:51,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2022-07-13 03:25:51,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:25:51,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:25:51,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-07-13 03:25:51,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:51,525 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 03:25:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-07-13 03:25:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-13 03:25:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 03:25:51,527 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 03:25:51,527 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 03:25:51,527 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:25:51,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-13 03:25:51,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:25:51,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:51,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:51,528 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-07-13 03:25:51,528 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:51,529 INFO L752 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 330#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 331#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 333#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 335#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 336#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 321#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 320#selectionSortENTRY [2022-07-13 03:25:51,529 INFO L754 eck$LassoCheckResult]: Loop: 320#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 323#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 328#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 329#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 324#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 325#L14-3 assume !(~index~0 < ~size); 332#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 322#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 320#selectionSortENTRY [2022-07-13 03:25:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2022-07-13 03:25:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213683581] [2022-07-13 03:25:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2022-07-13 03:25:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:51,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107537939] [2022-07-13 03:25:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:51,572 INFO L85 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2022-07-13 03:25:51,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:51,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096241626] [2022-07-13 03:25:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:51,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:52,237 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:52,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:52,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:52,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:52,238 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:52,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:52,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:52,238 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:52,238 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2022-07-13 03:25:52,238 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:52,238 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:52,241 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 03:25:52,246 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 03:25:52,248 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 03:25:52,249 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 03:25:52,252 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 03:25:52,254 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 03:25:52,256 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 03:25:52,258 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 03:25:52,259 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 03:25:52,261 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 03:25:52,263 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 03:25:52,265 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 03:25:52,267 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 03:25:52,268 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 03:25:52,270 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 03:25:52,272 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 03:25:52,274 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 03:25:52,276 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 03:25:52,278 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 03:25:52,280 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 03:25:52,282 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 03:25:52,284 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 03:25:52,285 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 03:25:52,287 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 03:25:52,289 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 03:25:52,291 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 03:25:52,293 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 03:25:52,451 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 03:25:52,459 INFO L158 Benchmark]: Toolchain (without parser) took 4084.03ms. Allocated memory was 96.5MB in the beginning and 169.9MB in the end (delta: 73.4MB). Free memory was 67.5MB in the beginning and 118.4MB in the end (delta: -50.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-07-13 03:25:52,462 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:25:52,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.72ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 67.3MB in the beginning and 114.7MB in the end (delta: -47.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:25:52,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.77ms. Allocated memory is still 138.4MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:25:52,465 INFO L158 Benchmark]: Boogie Preprocessor took 16.14ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 112.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:25:52,466 INFO L158 Benchmark]: RCFGBuilder took 273.59ms. Allocated memory is still 138.4MB. Free memory was 112.1MB in the beginning and 101.7MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:25:52,467 INFO L158 Benchmark]: BuchiAutomizer took 3568.69ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 101.7MB in the beginning and 118.4MB in the end (delta: -16.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-07-13 03:25:52,473 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.19ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.72ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 67.3MB in the beginning and 114.7MB in the end (delta: -47.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.77ms. Allocated memory is still 138.4MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.14ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 112.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.59ms. Allocated memory is still 138.4MB. Free memory was 112.1MB in the beginning and 101.7MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3568.69ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 101.7MB in the beginning and 118.4MB in the end (delta: -16.7MB). Peak memory consumption was 53.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 03:25:52,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:52,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null