./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.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 ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:06,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:06,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:06,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:06,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:06,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:06,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:06,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:06,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:06,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:06,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:06,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:06,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:06,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:06,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:06,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:06,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:06,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:06,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:06,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:06,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:06,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:06,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:06,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:06,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:06,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:06,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:06,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:06,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:06,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:06,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:06,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:06,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:06,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:06,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:06,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:06,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:06,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:06,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:06,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:06,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:06,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:06,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:06,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:06,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:06,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:06,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:06,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:06,392 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:06,392 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:06,392 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:06,392 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:06,393 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:06,393 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:06,393 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:06,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:06,394 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:06,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:06,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:06,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:06,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:06,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:06,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:06,395 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:06,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:06,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:06,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:06,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:06,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:06,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:06,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:06,397 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 -> ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f [2022-02-21 03:32:06,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:06,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:06,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:06,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:06,631 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:06,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-02-21 03:32:06,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef60831/72b31a598c744c91b8423d55794c6443/FLAG96877340d [2022-02-21 03:32:07,096 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:07,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-02-21 03:32:07,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef60831/72b31a598c744c91b8423d55794c6443/FLAG96877340d [2022-02-21 03:32:07,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef60831/72b31a598c744c91b8423d55794c6443 [2022-02-21 03:32:07,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:07,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:07,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:07,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:07,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:07,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478432ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07, skipping insertion in model container [2022-02-21 03:32:07,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:07,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:07,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:07,439 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:07,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:07,494 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:07,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07 WrapperNode [2022-02-21 03:32:07,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:07,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:07,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:07,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:07,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,549 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-02-21 03:32:07,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:07,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:07,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:07,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:07,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:07,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:07,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:07,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:07,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (1/1) ... [2022-02-21 03:32:07,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:07,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:07,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:32:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:07,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:07,723 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:07,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:07,889 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:07,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:07,894 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:07,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:07 BoogieIcfgContainer [2022-02-21 03:32:07,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:07,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:07,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:07,899 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:07,900 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:07,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:07" (1/3) ... [2022-02-21 03:32:07,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aea3f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:07, skipping insertion in model container [2022-02-21 03:32:07,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:07,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:07" (2/3) ... [2022-02-21 03:32:07,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aea3f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:07, skipping insertion in model container [2022-02-21 03:32:07,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:07,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:07" (3/3) ... [2022-02-21 03:32:07,903 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2022-02-21 03:32:07,938 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:07,938 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:07,938 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:07,938 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:07,939 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:07,939 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:07,939 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:07,939 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:07,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:07,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:07,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:07,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:07,986 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:07,986 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:07,986 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:07,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:07,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:07,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:07,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:07,994 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:07,994 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:07,999 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L562true assume !(main_~array_size~0#1 < 1); 14#L562-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 7#L550-3true [2022-02-21 03:32:08,000 INFO L793 eck$LassoCheckResult]: Loop: 7#L550-3true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 6#L551-3true assume !true; 13#L550-2true bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 7#L550-3true [2022-02-21 03:32:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:32:08,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:08,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773498614] [2022-02-21 03:32:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,174 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2022-02-21 03:32:08,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:08,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601537842] [2022-02-21 03:32:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:08,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {19#true} is VALID [2022-02-21 03:32:08,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-02-21 03:32:08,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#false} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {20#false} is VALID [2022-02-21 03:32:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:08,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:08,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601537842] [2022-02-21 03:32:08,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601537842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:08,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:08,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:08,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256868964] [2022-02-21 03:32:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:08,251 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:08,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:32:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:32:08,285 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:08,305 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:32:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:32:08,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:08,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-02-21 03:32:08,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:08,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2022-02-21 03:32:08,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:32:08,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:32:08,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:32:08,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:08,327 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:32:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:32:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:32:08,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:08,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,349 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,351 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:08,353 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:32:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:32:08,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:08,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:08,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:32:08,355 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:32:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:08,357 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:32:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:32:08,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:08,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:08,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:08,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:32:08,361 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:32:08,361 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:32:08,361 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:08,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:32:08,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:08,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:08,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:08,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:08,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:08,383 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 40#L562 assume !(main_~array_size~0#1 < 1); 41#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 42#L550-3 [2022-02-21 03:32:08,383 INFO L793 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 37#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 38#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 42#L550-3 [2022-02-21 03:32:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-02-21 03:32:08,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:08,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931342871] [2022-02-21 03:32:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,440 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2022-02-21 03:32:08,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:08,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667855032] [2022-02-21 03:32:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,462 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2022-02-21 03:32:08,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:08,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437348499] [2022-02-21 03:32:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:08,511 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:08,569 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:08,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:08,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:08,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:08,570 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:32:08,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:08,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:08,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-02-21 03:32:08,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:08,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:08,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,723 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:08,723 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:32:08,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:32:08,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:32:08,754 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:32:08,754 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:32:08,771 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 [2022-02-21 03:32:08,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:32:08,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:32:08,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:32:08,788 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:32:08,804 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 [2022-02-21 03:32:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:08,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:32:08,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:32:08,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:32:08,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:08,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:32:08,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,877 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:32:08,877 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_ALL_1=0} Honda state: {v_rep~unnamed0~0~P_ALL_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:32:08,894 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 [2022-02-21 03:32:08,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:08,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:32:08,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:08,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:08,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:08,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:32:08,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:32:08,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:32:08,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:08,957 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:08,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:08,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:08,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:08,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:08,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:08,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:08,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:08,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-02-21 03:32:08,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:08,957 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:08,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:08,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:09,064 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:09,068 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:09,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:09,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:09,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:09,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:09,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:09,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:09,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:09,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:09,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:09,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:09,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:09,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:09,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:09,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:09,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:09,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:32:09,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:09,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:32:09,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:09,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:09,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:09,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:09,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:09,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:09,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:09,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:09,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:09,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:32:09,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:09,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:09,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:09,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:09,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:09,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:09,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:09,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:09,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:32:09,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:09,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:09,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:09,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:09,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:09,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:09,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:09,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:09,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:09,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:32:09,318 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:32:09,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,323 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:32:09,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:09,356 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:32:09,356 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:09,356 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:32:09,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,404 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:32:09,408 INFO L390 LassoCheck]: Loop: "assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1;" "assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);" "bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1;" [2022-02-21 03:32:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:09,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:09,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {70#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {70#unseeded} is VALID [2022-02-21 03:32:09,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {70#unseeded} is VALID [2022-02-21 03:32:09,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#unseeded} assume !(main_~array_size~0#1 < 1); {70#unseeded} is VALID [2022-02-21 03:32:09,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {70#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {70#unseeded} is VALID [2022-02-21 03:32:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:09,502 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:09,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:09,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#(>= oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) 1))} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {97#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 03:32:09,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {97#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 03:32:09,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {97#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {83#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) 1))))} is VALID [2022-02-21 03:32:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:09,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:09,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:09,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:09,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 15 states and 22 transitions. Complement of second has 4 states. [2022-02-21 03:32:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:09,620 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:09,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:32:09,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:09,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2022-02-21 03:32:09,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:09,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,626 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:32:09,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:09,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:09,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:09,628 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:09,629 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:09,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:32:09,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:32:09,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:32:09,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:09,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:09,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:09,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:09,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:09,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:09,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:09,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:09,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,652 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:32:09,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:09,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:09,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:32:09,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:09,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:09,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:09,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2022-02-21 03:32:09,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:09,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:32:09,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-02-21 03:32:09,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:09,669 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:32:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-02-21 03:32:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:32:09,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:09,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,671 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,671 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:09,677 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:32:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:32:09,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:09,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:09,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:32:09,680 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:32:09,680 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:09,682 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2022-02-21 03:32:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2022-02-21 03:32:09,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:09,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:09,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:09,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2022-02-21 03:32:09,685 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:32:09,685 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:32:09,685 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:09,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2022-02-21 03:32:09,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:09,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,687 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:09,687 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:09,687 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 134#L562 assume !(main_~array_size~0#1 < 1); 135#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 136#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 128#L551-3 [2022-02-21 03:32:09,688 INFO L793 eck$LassoCheckResult]: Loop: 128#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 131#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 127#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 128#L551-3 [2022-02-21 03:32:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-02-21 03:32:09,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:09,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287120010] [2022-02-21 03:32:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,727 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2022-02-21 03:32:09,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:09,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36909771] [2022-02-21 03:32:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,761 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2022-02-21 03:32:09,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:09,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095671490] [2022-02-21 03:32:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:09,801 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:10,191 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:10,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:10,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:10,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:10,192 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:10,192 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:10,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:10,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:10,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2022-02-21 03:32:10,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:10,202 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:10,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:10,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:10,853 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:10,858 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:10,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:10,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:32:10,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:10,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:10,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:10,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:10,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:10,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:10,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:10,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:10,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:10,908 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:10,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:32:10,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:10,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:10,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:10,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:10,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:10,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:10,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:10,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:10,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:32:10,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:10,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:10,945 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:10,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:10,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:10,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:10,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:10,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:10,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:10,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:10,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:32:10,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:11,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:11,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:32:11,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:32:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,047 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:32:11,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:11,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:11,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,105 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:11,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:11,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:32:11,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,159 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:11,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:11,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:32:11,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,218 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:11,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:11,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:11,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:32:11,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,273 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:32:11,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:11,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:11,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:11,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,329 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:32:11,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:11,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:11,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,386 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:11,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:11,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:32:11,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:11,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,445 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:32:11,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:11,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:11,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:11,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:11,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:11,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:11,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:11,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:11,507 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:32:11,507 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 03:32:11,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:11,512 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:11,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:11,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:32:11,544 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:11,545 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:11,545 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~i~0#1) = -2*ULTIMATE.start_bubbleSort_~j~0#1 + 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:32:11,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,593 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:32:11,598 INFO L390 LassoCheck]: Loop: "assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);" "assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);" "bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1;" [2022-02-21 03:32:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:11,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {211#unseeded} is VALID [2022-02-21 03:32:11,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {211#unseeded} is VALID [2022-02-21 03:32:11,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#unseeded} assume !(main_~array_size~0#1 < 1); {211#unseeded} is VALID [2022-02-21 03:32:11,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {211#unseeded} is VALID [2022-02-21 03:32:11,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#unseeded} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {211#unseeded} is VALID [2022-02-21 03:32:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:11,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(>= oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) (* (- 2) |ULTIMATE.start_bubbleSort_~j~0#1|) 1))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {261#(and (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|) (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) (* |ULTIMATE.start_bubbleSort_~j~0#1| (- 2)) 1)))} is VALID [2022-02-21 03:32:11,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#(and (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|) (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) (* |ULTIMATE.start_bubbleSort_~j~0#1| (- 2)) 1)))} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {261#(and (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|) (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) (* |ULTIMATE.start_bubbleSort_~j~0#1| (- 2)) 1)))} is VALID [2022-02-21 03:32:11,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#(and (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|) (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) (* |ULTIMATE.start_bubbleSort_~j~0#1| (- 2)) 1)))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {244#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) (* (- 2) |ULTIMATE.start_bubbleSort_~j~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:32:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:11,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:11,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:11,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 41 transitions. Complement of second has 7 states. [2022-02-21 03:32:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:11,772 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:11,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:11,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:11,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:11,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:11,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:11,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:11,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2022-02-21 03:32:11,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:11,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:11,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:11,775 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:11,776 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:11,776 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:11,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:11,777 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2022-02-21 03:32:11,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:11,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:32:11,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:32:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:32:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:11,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:11,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:11,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:11,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:11,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:11,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:11,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:32:11,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:32:11,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:32:11,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,789 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:32:11,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:11,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:11,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:11,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:11,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2022-02-21 03:32:11,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:11,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2022-02-21 03:32:11,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:11,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:32:11,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 03:32:11,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:11,794 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 03:32:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 03:32:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-02-21 03:32:11,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:11,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,795 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,795 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,796 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:11,797 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 03:32:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 03:32:11,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:11,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:11,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 03:32:11,798 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 03:32:11,798 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:11,799 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 03:32:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 03:32:11,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:11,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:11,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:11,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:32:11,801 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:11,801 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:11,801 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:11,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:32:11,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:11,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:11,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:11,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:11,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:11,802 INFO L791 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 317#L562 assume !(main_~array_size~0#1 < 1); 318#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 315#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 311#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 313#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 316#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 309#L551-3 [2022-02-21 03:32:11,803 INFO L793 eck$LassoCheckResult]: Loop: 309#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 312#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 308#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 309#L551-3 [2022-02-21 03:32:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2022-02-21 03:32:11,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:11,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704619717] [2022-02-21 03:32:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:11,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {410#true} is VALID [2022-02-21 03:32:11,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {410#true} is VALID [2022-02-21 03:32:11,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} assume !(main_~array_size~0#1 < 1); {410#true} is VALID [2022-02-21 03:32:11,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {410#true} is VALID [2022-02-21 03:32:11,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {412#(= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0)} is VALID [2022-02-21 03:32:11,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#(= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0)} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {413#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 03:32:11,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {414#(<= (+ |ULTIMATE.start_bubbleSort_~i~0#1| 1) 0)} is VALID [2022-02-21 03:32:11,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#(<= (+ |ULTIMATE.start_bubbleSort_~i~0#1| 1) 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {411#false} is VALID [2022-02-21 03:32:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:11,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:11,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704619717] [2022-02-21 03:32:11,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704619717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:11,845 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:11,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:11,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46845797] [2022-02-21 03:32:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:11,846 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2022-02-21 03:32:11,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:11,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230637554] [2022-02-21 03:32:11,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:11,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:11,860 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:11,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:11,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:32:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:32:11,991 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:12,059 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-02-21 03:32:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:32:12,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:12,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-02-21 03:32:12,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:12,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-02-21 03:32:12,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:12,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:12,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 03:32:12,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:12,070 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:32:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 03:32:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2022-02-21 03:32:12,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:12,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,072 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,072 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,072 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:12,074 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-02-21 03:32:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-21 03:32:12,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:12,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:32:12,074 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:32:12,075 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:12,076 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-02-21 03:32:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-21 03:32:12,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:12,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:12,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:12,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:32:12,078 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:32:12,078 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:32:12,078 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:12,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:32:12,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:12,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:12,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:12,078 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:12,078 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:12,079 INFO L791 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 451#L562 assume !(main_~array_size~0#1 < 1); 452#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 453#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 449#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 450#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 446#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 447#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 455#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 454#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 445#L551-3 [2022-02-21 03:32:12,079 INFO L793 eck$LassoCheckResult]: Loop: 445#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 448#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 444#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 445#L551-3 [2022-02-21 03:32:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2022-02-21 03:32:12,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102477298] [2022-02-21 03:32:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,125 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2022-02-21 03:32:12,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150062998] [2022-02-21 03:32:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,145 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2022-02-21 03:32:12,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470676765] [2022-02-21 03:32:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:12,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {577#true} is VALID [2022-02-21 03:32:12,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {577#true} is VALID [2022-02-21 03:32:12,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(main_~array_size~0#1 < 1); {577#true} is VALID [2022-02-21 03:32:12,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {577#true} is VALID [2022-02-21 03:32:12,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} is VALID [2022-02-21 03:32:12,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} is VALID [2022-02-21 03:32:12,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 03:32:12,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {583#(and (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} is VALID [2022-02-21 03:32:12,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {583#(and (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {578#false} is VALID [2022-02-21 03:32:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:12,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:12,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470676765] [2022-02-21 03:32:12,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470676765] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:12,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221366013] [2022-02-21 03:32:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,233 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-21 03:32:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:12,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:32:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:12,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:12,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {577#true} is VALID [2022-02-21 03:32:12,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {577#true} is VALID [2022-02-21 03:32:12,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(main_~array_size~0#1 < 1); {577#true} is VALID [2022-02-21 03:32:12,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {577#true} is VALID [2022-02-21 03:32:12,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} is VALID [2022-02-21 03:32:12,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} is VALID [2022-02-21 03:32:12,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 03:32:12,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {617#(and (<= 1 |ULTIMATE.start_bubbleSort_~j~0#1|) (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0))} is VALID [2022-02-21 03:32:12,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#(and (<= 1 |ULTIMATE.start_bubbleSort_~j~0#1|) (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {578#false} is VALID [2022-02-21 03:32:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:12,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:12,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {578#false} is VALID [2022-02-21 03:32:12,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {633#(not (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {578#false} is VALID [2022-02-21 03:32:12,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {633#(not (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 03:32:12,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {582#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 03:32:12,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {581#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 1)} is VALID [2022-02-21 03:32:12,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {580#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 2)} is VALID [2022-02-21 03:32:12,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {579#(<= |ULTIMATE.start_bubbleSort_~j~0#1| 1)} is VALID [2022-02-21 03:32:12,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {577#true} is VALID [2022-02-21 03:32:12,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(main_~array_size~0#1 < 1); {577#true} is VALID [2022-02-21 03:32:12,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {577#true} is VALID [2022-02-21 03:32:12,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {577#true} is VALID [2022-02-21 03:32:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:12,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221366013] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:12,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:12,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-02-21 03:32:12,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587576025] [2022-02-21 03:32:12,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:12,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:32:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:32:12,652 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:12,799 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-21 03:32:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:32:12,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:12,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-02-21 03:32:12,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:12,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2022-02-21 03:32:12,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:32:12,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:32:12,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2022-02-21 03:32:12,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:12,818 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-02-21 03:32:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2022-02-21 03:32:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-02-21 03:32:12,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:12,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,820 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,820 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,821 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:12,822 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-21 03:32:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-02-21 03:32:12,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:12,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:12,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 34 transitions. [2022-02-21 03:32:12,823 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 34 transitions. [2022-02-21 03:32:12,824 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:12,825 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-21 03:32:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-02-21 03:32:12,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:12,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:12,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:12,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-21 03:32:12,827 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:32:12,827 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:32:12,827 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:32:12,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:32:12,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:12,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:12,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:12,828 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:12,828 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:12,829 INFO L791 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 706#L562 assume !(main_~array_size~0#1 < 1); 707#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 708#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 704#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 705#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 701#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 702#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 712#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 713#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 711#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 710#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 709#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 700#L551-3 [2022-02-21 03:32:12,829 INFO L793 eck$LassoCheckResult]: Loop: 700#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 703#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 699#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 700#L551-3 [2022-02-21 03:32:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2022-02-21 03:32:12,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330060428] [2022-02-21 03:32:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,874 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2022-02-21 03:32:12,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501767352] [2022-02-21 03:32:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:12,891 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2022-02-21 03:32:12,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:12,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972833305] [2022-02-21 03:32:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {871#true} is VALID [2022-02-21 03:32:13,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {871#true} is VALID [2022-02-21 03:32:13,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume !(main_~array_size~0#1 < 1); {871#true} is VALID [2022-02-21 03:32:13,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {871#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {873#(= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0)} is VALID [2022-02-21 03:32:13,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {874#(and (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)) 4) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} is VALID [2022-02-21 03:32:13,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#(and (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)) 4) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {875#(and (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem5#1|))} is VALID [2022-02-21 03:32:13,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {875#(and (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem5#1|))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} is VALID [2022-02-21 03:32:13,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {877#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} is VALID [2022-02-21 03:32:13,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {878#(and (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) |ULTIMATE.start_bubbleSort_#t~mem4#1|))} is VALID [2022-02-21 03:32:13,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) |ULTIMATE.start_bubbleSort_#t~mem4#1|))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {877#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} is VALID [2022-02-21 03:32:13,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {877#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))) (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} is VALID [2022-02-21 03:32:13,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {880#(and (<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} is VALID [2022-02-21 03:32:13,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {880#(and (<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {872#false} is VALID [2022-02-21 03:32:13,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {872#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {872#false} is VALID [2022-02-21 03:32:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:13,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:13,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972833305] [2022-02-21 03:32:13,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972833305] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:13,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369272874] [2022-02-21 03:32:13,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:32:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:13,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:13,242 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:13,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 03:32:13,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:32:13,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:32:13,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:32:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:13,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:32:13,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-21 03:32:13,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {871#true} is VALID [2022-02-21 03:32:13,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {871#true} is VALID [2022-02-21 03:32:13,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume !(main_~array_size~0#1 < 1); {871#true} is VALID [2022-02-21 03:32:13,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {871#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {873#(= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0)} is VALID [2022-02-21 03:32:13,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {874#(and (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)) 4) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} is VALID [2022-02-21 03:32:13,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#(and (= (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)) 4) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {899#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (* (div (+ (* (- 1) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) 4) 4) 4) (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset|)) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= |ULTIMATE.start_bubbleSort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (* (div (+ (* (- 1) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) 4) 4) 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset|))))} is VALID [2022-02-21 03:32:13,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#(and (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (* (div (+ (* (- 1) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) 4) 4) 4) (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset|)) |ULTIMATE.start_bubbleSort_#t~mem4#1|) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= |ULTIMATE.start_bubbleSort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (* (div (+ (* (- 1) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) 4) 4) 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset|))))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:13,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {879#(and (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} is VALID [2022-02-21 03:32:13,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {876#(and (= 0 (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (= |ULTIMATE.start_bubbleSort_~numbers#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4)))))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {927#(<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|)} is VALID [2022-02-21 03:32:13,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|)} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {872#false} is VALID [2022-02-21 03:32:13,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {872#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {872#false} is VALID [2022-02-21 03:32:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:32:13,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:13,817 INFO L356 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2022-02-21 03:32:13,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 32 [2022-02-21 03:32:14,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {872#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {872#false} is VALID [2022-02-21 03:32:14,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|)} assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {872#false} is VALID [2022-02-21 03:32:14,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {927#(<= |ULTIMATE.start_bubbleSort_#t~mem4#1| |ULTIMATE.start_bubbleSort_#t~mem5#1|)} is VALID [2022-02-21 03:32:14,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {940#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ (- 4) |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| (* |ULTIMATE.start_bubbleSort_~j~0#1| 4))))} is VALID [2022-02-21 03:32:14,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#(or (< |ULTIMATE.start_bubbleSort_#t~mem5#1| |ULTIMATE.start_bubbleSort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; {944#(<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4)))} is VALID [2022-02-21 03:32:14,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#(= (* |ULTIMATE.start_bubbleSort_~j~0#1| 4) 4)} assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); {966#(or (< |ULTIMATE.start_bubbleSort_#t~mem5#1| |ULTIMATE.start_bubbleSort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) |ULTIMATE.start_bubbleSort_~numbers#1.offset|) (select (select |#memory_int| |ULTIMATE.start_bubbleSort_~numbers#1.base|) (+ |ULTIMATE.start_bubbleSort_~numbers#1.offset| 4))))} is VALID [2022-02-21 03:32:14,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {871#true} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {970#(= (* |ULTIMATE.start_bubbleSort_~j~0#1| 4) 4)} is VALID [2022-02-21 03:32:14,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {871#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {871#true} is VALID [2022-02-21 03:32:14,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume !(main_~array_size~0#1 < 1); {871#true} is VALID [2022-02-21 03:32:14,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {871#true} is VALID [2022-02-21 03:32:14,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {871#true} is VALID [2022-02-21 03:32:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:32:14,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369272874] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:14,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:14,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2022-02-21 03:32:14,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969774535] [2022-02-21 03:32:14,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:14,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:32:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:32:14,126 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:14,340 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-21 03:32:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:32:14,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:14,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2022-02-21 03:32:14,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:32:14,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2022-02-21 03:32:14,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:32:14,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:32:14,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2022-02-21 03:32:14,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:14,387 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-21 03:32:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2022-02-21 03:32:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-02-21 03:32:14,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:14,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 50 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,389 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 50 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,389 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,390 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:14,392 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-02-21 03:32:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-02-21 03:32:14,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:14,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:14,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states and 50 transitions. [2022-02-21 03:32:14,393 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states and 50 transitions. [2022-02-21 03:32:14,393 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:14,395 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-02-21 03:32:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-02-21 03:32:14,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:14,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:14,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:14,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-02-21 03:32:14,397 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-21 03:32:14,397 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-21 03:32:14,397 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:32:14,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-02-21 03:32:14,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:14,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:14,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:14,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:14,398 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:14,398 INFO L791 eck$LassoCheckResult]: Stem: 1022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1031#L562 assume !(main_~array_size~0#1 < 1); 1032#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 1033#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1034#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1044#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 1026#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 1027#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1030#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1037#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 1043#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1039#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 1040#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1025#L551-3 [2022-02-21 03:32:14,398 INFO L793 eck$LassoCheckResult]: Loop: 1025#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1047#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1024#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 1025#L551-3 [2022-02-21 03:32:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2022-02-21 03:32:14,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746596543] [2022-02-21 03:32:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,433 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2022-02-21 03:32:14,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422277381] [2022-02-21 03:32:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2022-02-21 03:32:14,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189000272] [2022-02-21 03:32:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,487 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:15,013 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:15,014 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:15,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:15,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:15,014 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:15,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:15,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:15,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2022-02-21 03:32:15,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:15,014 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:15,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:15,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:15,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:15,070 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4) (- 4)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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) [2022-02-21 03:32:15,073 INFO L158 Benchmark]: Toolchain (without parser) took 7938.57ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 54.9MB in the beginning and 37.8MB in the end (delta: 17.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-02-21 03:32:15,073 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 60.6MB in the beginning and 60.6MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:15,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.53ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.7MB in the beginning and 81.3MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:15,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.47ms. Allocated memory is still 113.2MB. Free memory was 81.3MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:15,074 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 78.2MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:15,074 INFO L158 Benchmark]: RCFGBuilder took 324.84ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 66.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:15,075 INFO L158 Benchmark]: BuchiAutomizer took 7175.73ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 37.8MB in the end (delta: 28.3MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:15,076 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 60.6MB in the beginning and 60.6MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.53ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.7MB in the beginning and 81.3MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.47ms. Allocated memory is still 113.2MB. Free memory was 81.3MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 78.2MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.84ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 66.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7175.73ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 37.8MB in the end (delta: 28.3MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4) (- 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4) (- 4)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:32:15,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-02-21 03:32:15,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*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: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4) (- 4)))_1 was not added to the transformula!