./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 e19ca921 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-dev-e19ca92 [2021-12-22 19:56:37,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 19:56:37,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 19:56:37,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 19:56:37,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 19:56:37,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 19:56:37,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 19:56:37,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 19:56:37,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 19:56:37,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 19:56:37,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 19:56:37,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 19:56:37,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 19:56:37,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 19:56:37,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 19:56:37,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 19:56:37,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 19:56:37,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 19:56:37,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 19:56:37,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 19:56:37,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 19:56:37,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 19:56:37,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 19:56:37,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 19:56:37,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 19:56:37,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 19:56:37,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 19:56:37,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 19:56:37,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 19:56:37,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 19:56:37,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 19:56:37,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 19:56:37,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 19:56:37,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 19:56:37,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 19:56:37,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 19:56:37,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 19:56:37,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 19:56:37,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 19:56:37,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 19:56:37,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 19:56:37,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-22 19:56:37,664 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 19:56:37,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 19:56:37,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 19:56:37,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 19:56:37,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 19:56:37,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 19:56:37,666 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 19:56:37,667 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 19:56:37,667 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 19:56:37,667 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 19:56:37,668 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 19:56:37,668 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 19:56:37,668 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 19:56:37,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 19:56:37,668 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 19:56:37,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 19:56:37,670 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 19:56:37,670 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 19:56:37,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 19:56:37,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 19:56:37,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 19:56:37,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 19:56:37,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 19:56:37,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 19:56:37,672 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 19:56:37,672 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 [2021-12-22 19:56:37,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 19:56:37,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 19:56:37,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 19:56:37,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 19:56:37,940 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 19:56:37,941 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 [2021-12-22 19:56:37,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2902a38d/1ed6ad7b0773419aaed359fc286c6480/FLAG1d5739d5b [2021-12-22 19:56:38,430 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 19:56:38,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2021-12-22 19:56:38,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2902a38d/1ed6ad7b0773419aaed359fc286c6480/FLAG1d5739d5b [2021-12-22 19:56:38,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2902a38d/1ed6ad7b0773419aaed359fc286c6480 [2021-12-22 19:56:38,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 19:56:38,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 19:56:38,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:38,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 19:56:38,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 19:56:38,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4688bfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38, skipping insertion in model container [2021-12-22 19:56:38,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 19:56:38,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 19:56:38,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:38,695 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 19:56:38,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:38,733 INFO L208 MainTranslator]: Completed translation [2021-12-22 19:56:38,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38 WrapperNode [2021-12-22 19:56:38,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:38,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:38,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 19:56:38,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 19:56:38,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,765 INFO L137 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2021-12-22 19:56:38,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:38,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 19:56:38,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 19:56:38,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 19:56:38,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 19:56:38,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 19:56:38,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 19:56:38,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 19:56:38,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (1/1) ... [2021-12-22 19:56:38,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:38,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:38,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:38,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 19:56:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 19:56:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 19:56:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 19:56:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 19:56:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 19:56:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2021-12-22 19:56:38,890 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2021-12-22 19:56:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 19:56:38,955 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 19:56:38,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 19:56:39,101 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 19:56:39,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 19:56:39,106 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 19:56:39,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:39 BoogieIcfgContainer [2021-12-22 19:56:39,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 19:56:39,109 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 19:56:39,109 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 19:56:39,112 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 19:56:39,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:39,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:56:38" (1/3) ... [2021-12-22 19:56:39,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6989122e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:39, skipping insertion in model container [2021-12-22 19:56:39,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:39,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:38" (2/3) ... [2021-12-22 19:56:39,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6989122e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:39, skipping insertion in model container [2021-12-22 19:56:39,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:39,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:39" (3/3) ... [2021-12-22 19:56:39,117 INFO L388 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2021-12-22 19:56:39,161 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 19:56:39,161 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 19:56:39,170 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 19:56:39,170 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 19:56:39,170 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 19:56:39,170 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 19:56:39,170 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 19:56:39,171 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 19:56:39,184 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) [2021-12-22 19:56:39,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 19:56:39,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:39,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:39,232 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 19:56:39,247 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 19:56:39,247 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 19:56:39,248 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) [2021-12-22 19:56:39,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 19:56:39,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:39,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:39,251 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 19:56:39,251 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 19:56:39,257 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#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; 10#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; 13#L36-3true [2021-12-22 19:56:39,257 INFO L793 eck$LassoCheckResult]: Loop: 13#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; 14#L36-2true main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13#L36-3true [2021-12-22 19:56:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-12-22 19:56:39,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:39,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995233203] [2021-12-22 19:56:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:39,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2021-12-22 19:56:39,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:39,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348095076] [2021-12-22 19:56:39,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:39,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2021-12-22 19:56:39,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:39,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955398240] [2021-12-22 19:56:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:39,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:39,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:39,770 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:56:39,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:56:39,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:56:39,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:56:39,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:56:39,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:39,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:56:39,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:56:39,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2021-12-22 19:56:39,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:56:39,773 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:56:39,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:40,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 19:56:40,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 19:56:40,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:40,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:40,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-22 19:56:40,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-22 19:56:40,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:40,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:40,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:40,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-22 19:56:40,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-22 19:56:40,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:40,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:40,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:40,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:40,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:40,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:40,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-22 19:56:40,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-22 19:56:40,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:40,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:40,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:40,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-22 19:56:40,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-22 19:56:40,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:40,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:40,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-22 19:56:40,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:40,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:40,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:40,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:40,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-22 19:56:40,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:40,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:40,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:40,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:40,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:40,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:40,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:40,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 19:56:40,493 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-22 19:56:40,494 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-22 19:56:40,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:40,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:40,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 19:56:40,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-22 19:56:40,529 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 19:56:40,530 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 19:56:40,530 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 [] [2021-12-22 19:56:40,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:40,565 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-12-22 19:56:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:40,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:40,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:40,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 19:56:40,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:40,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-22 19:56:40,660 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) [2021-12-22 19:56:40,694 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. [2021-12-22 19:56:40,696 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 [2021-12-22 19:56:40,700 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) [2021-12-22 19:56:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2021-12-22 19:56:40,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2021-12-22 19:56:40,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:40,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-22 19:56:40,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:40,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-22 19:56:40,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:40,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2021-12-22 19:56:40,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 19:56:40,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2021-12-22 19:56:40,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-22 19:56:40,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-22 19:56:40,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-22 19:56:40,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:40,713 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-22 19:56:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-22 19:56:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-22 19:56:40,732 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) [2021-12-22 19:56:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-22 19:56:40,734 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-22 19:56:40,734 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-22 19:56:40,734 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 19:56:40,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-22 19:56:40,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 19:56:40,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:40,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:40,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:40,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:40,736 INFO L791 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 [2021-12-22 19:56:40,736 INFO L793 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 [2021-12-22 19:56:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2021-12-22 19:56:40,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:40,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902155594] [2021-12-22 19:56:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:40,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:40,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:40,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902155594] [2021-12-22 19:56:40,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902155594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:40,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:40,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:56:40,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584749897] [2021-12-22 19:56:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:40,779 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 19:56:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2021-12-22 19:56:40,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:40,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417612439] [2021-12-22 19:56:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:40,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:40,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417612439] [2021-12-22 19:56:40,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417612439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:40,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:40,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:56:40,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493305860] [2021-12-22 19:56:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:40,801 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:56:40,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:56:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:56:40,805 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) [2021-12-22 19:56:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:40,818 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-12-22 19:56:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:56:40,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-12-22 19:56:40,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:40,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-12-22 19:56:40,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 19:56:40,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:40,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-22 19:56:40,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:40,822 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-22 19:56:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-22 19:56:40,823 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) [2021-12-22 19:56:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-12-22 19:56:40,824 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:40,824 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:40,824 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 19:56:40,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2021-12-22 19:56:40,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:40,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:40,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:40,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:40,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:40,826 INFO L791 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 [2021-12-22 19:56:40,826 INFO L793 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 [2021-12-22 19:56:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2021-12-22 19:56:40,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:40,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749795404] [2021-12-22 19:56:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:40,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:40,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:40,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749795404] [2021-12-22 19:56:40,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749795404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:40,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:40,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:56:40,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370475895] [2021-12-22 19:56:40,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:40,849 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 19:56:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2021-12-22 19:56:40,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016974455] [2021-12-22 19:56:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:40,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:40,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:40,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:41,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:41,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:56:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:56:41,330 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) [2021-12-22 19:56:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:41,338 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2021-12-22 19:56:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:56:41,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2021-12-22 19:56:41,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:41,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2021-12-22 19:56:41,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 19:56:41,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:41,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-12-22 19:56:41,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:41,341 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-22 19:56:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-12-22 19:56:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-12-22 19:56:41,342 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) [2021-12-22 19:56:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-12-22 19:56:41,343 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-22 19:56:41,343 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-22 19:56:41,343 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 19:56:41,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2021-12-22 19:56:41,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:41,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:41,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:41,344 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:41,345 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:41,345 INFO L791 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 [2021-12-22 19:56:41,345 INFO L793 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 [2021-12-22 19:56:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2021-12-22 19:56:41,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:41,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618535609] [2021-12-22 19:56:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:41,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:41,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:41,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2021-12-22 19:56:41,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:41,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965146723] [2021-12-22 19:56:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:41,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:41,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:41,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2021-12-22 19:56:41,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:41,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720535098] [2021-12-22 19:56:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:41,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 19:56:41,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:41,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720535098] [2021-12-22 19:56:41,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720535098] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:56:41,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954035503] [2021-12-22 19:56:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:41,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:56:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:41,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 19:56:41,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 19:56:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:41,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 19:56:41,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 19:56:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:56:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 19:56:41,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954035503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 19:56:41,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 19:56:41,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-12-22 19:56:41,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781591015] [2021-12-22 19:56:41,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 19:56:42,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 19:56:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-22 19:56:42,035 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) [2021-12-22 19:56:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:42,090 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-22 19:56:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 19:56:42,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2021-12-22 19:56:42,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:42,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2021-12-22 19:56:42,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 19:56:42,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:42,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2021-12-22 19:56:42,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:42,093 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-12-22 19:56:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2021-12-22 19:56:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-22 19:56:42,094 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) [2021-12-22 19:56:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-12-22 19:56:42,095 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-22 19:56:42,095 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-22 19:56:42,095 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 19:56:42,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2021-12-22 19:56:42,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:42,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:42,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:42,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-12-22 19:56:42,096 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:42,096 INFO L791 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 [2021-12-22 19:56:42,096 INFO L793 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 [2021-12-22 19:56:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2021-12-22 19:56:42,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:42,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619057978] [2021-12-22 19:56:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:42,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,118 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2021-12-22 19:56:42,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791134460] [2021-12-22 19:56:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:42,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,150 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2021-12-22 19:56:42,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913172395] [2021-12-22 19:56:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:42,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:42,208 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:42,921 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:56:42,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:56:42,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:56:42,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:56:42,922 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:56:42,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:42,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:56:42,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:56:42,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2021-12-22 19:56:42,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:56:42,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:56:42,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:42,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:43,013 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:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java: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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) 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) [2021-12-22 19:56:43,029 INFO L158 Benchmark]: Toolchain (without parser) took 4558.10ms. Allocated memory was 94.4MB in the beginning and 148.9MB in the end (delta: 54.5MB). Free memory was 58.1MB in the beginning and 102.6MB in the end (delta: -44.4MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2021-12-22 19:56:43,029 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:43,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.11ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 71.0MB in the end (delta: -13.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2021-12-22 19:56:43,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.64ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:56:43,030 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.5MB in the end (delta: 890.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:43,031 INFO L158 Benchmark]: RCFGBuilder took 299.92ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 58.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 19:56:43,031 INFO L158 Benchmark]: BuchiAutomizer took 3919.00ms. Allocated memory was 94.4MB in the beginning and 148.9MB in the end (delta: 54.5MB). Free memory was 58.1MB in the beginning and 102.6MB in the end (delta: -44.5MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2021-12-22 19:56:43,033 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 94.4MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.11ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 71.0MB in the end (delta: -13.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.64ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.5MB in the end (delta: 890.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.92ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 58.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3919.00ms. Allocated memory was 94.4MB in the beginning and 148.9MB in the end (delta: 54.5MB). Free memory was 58.1MB in the beginning and 102.6MB in the end (delta: -44.5MB). Peak memory consumption was 59.9MB. 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. [2021-12-22 19:56:43,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:43,262 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