./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/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-ff03de6 [2021-12-21 22:02:50,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:02:50,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:02:50,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:02:50,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:02:50,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:02:50,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:02:50,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:02:50,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:02:50,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:02:50,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:02:50,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:02:50,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:02:50,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:02:50,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:02:50,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:02:50,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:02:50,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:02:50,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:02:50,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:02:50,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:02:50,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:02:50,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:02:50,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:02:50,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:02:50,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:02:50,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:02:50,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:02:50,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:02:50,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:02:50,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:02:50,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:02:50,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:02:50,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:02:50,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:02:50,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:02:50,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:02:50,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:02:50,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:02:50,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:02:50,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:02:50,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-21 22:02:50,815 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:02:50,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:02:50,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:02:50,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:02:50,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:02:50,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:02:50,819 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:02:50,819 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:02:50,819 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:02:50,820 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:02:50,820 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:02:50,820 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:02:50,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:02:50,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:02:50,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:02:50,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:02:50,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:02:50,822 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:02:50,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:02:50,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:02:50,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:02:50,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:02:50,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:02:50,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:02:50,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:02:50,825 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 [2021-12-21 22:02:50,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:02:51,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:02:51,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:02:51,009 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:02:51,009 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:02:51,010 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 [2021-12-21 22:02:51,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0207284/efcd0644ca9d4017a0f4f2c02aeca826/FLAG679ecec7b [2021-12-21 22:02:51,395 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:02:51,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2021-12-21 22:02:51,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0207284/efcd0644ca9d4017a0f4f2c02aeca826/FLAG679ecec7b [2021-12-21 22:02:51,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0207284/efcd0644ca9d4017a0f4f2c02aeca826 [2021-12-21 22:02:51,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:02:51,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:02:51,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:02:51,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:02:51,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:02:51,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:02:51" (1/1) ... [2021-12-21 22:02:51,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6a482d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:51, skipping insertion in model container [2021-12-21 22:02:51,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:02:51" (1/1) ... [2021-12-21 22:02:51,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:02:51,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:02:52,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:02:52,057 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:02:52,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:02:52,120 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:02:52,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52 WrapperNode [2021-12-21 22:02:52,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:02:52,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:02:52,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:02:52,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:02:52,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,163 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2021-12-21 22:02:52,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:02:52,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:02:52,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:02:52,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:02:52,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:02:52,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:02:52,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:02:52,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:02:52,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (1/1) ... [2021-12-21 22:02:52,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:52,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:52,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:02:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:02:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:02:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:02:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:02:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:02:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:02:52,342 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:02:52,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:02:52,456 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:02:52,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:02:52,460 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 22:02:52,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:02:52 BoogieIcfgContainer [2021-12-21 22:02:52,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:02:52,462 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:02:52,463 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:02:52,465 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:02:52,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:02:52,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:02:51" (1/3) ... [2021-12-21 22:02:52,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a8065dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:02:52, skipping insertion in model container [2021-12-21 22:02:52,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:02:52,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:02:52" (2/3) ... [2021-12-21 22:02:52,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a8065dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:02:52, skipping insertion in model container [2021-12-21 22:02:52,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:02:52,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:02:52" (3/3) ... [2021-12-21 22:02:52,469 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2021-12-21 22:02:52,507 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:02:52,507 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:02:52,507 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:02:52,507 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:02:52,507 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:02:52,508 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:02:52,508 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:02:52,508 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:02:52,519 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) [2021-12-21 22:02:52,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:02:52,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:52,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:52,546 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-21 22:02:52,546 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:52,546 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:02:52,546 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) [2021-12-21 22:02:52,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:02:52,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:52,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:52,549 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-21 22:02:52,549 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:52,555 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 [2021-12-21 22:02:52,555 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 [2021-12-21 22:02:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-21 22:02:52,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:52,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318753820] [2021-12-21 22:02:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:52,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2021-12-21 22:02:52,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:52,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534054412] [2021-12-21 22:02:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:52,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:52,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:02:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534054412] [2021-12-21 22:02:52,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534054412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:02:52,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:02:52,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:02:52,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155318749] [2021-12-21 22:02:52,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:02:52,766 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:02:52,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:02:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 22:02:52,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 22:02:52,795 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) [2021-12-21 22:02:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:02:52,800 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-21 22:02:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 22:02:52,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-21 22:02:52,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:02:52,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2021-12-21 22:02:52,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-21 22:02:52,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-21 22:02:52,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2021-12-21 22:02:52,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:02:52,812 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2021-12-21 22:02:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2021-12-21 22:02:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-21 22:02:52,829 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) [2021-12-21 22:02:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2021-12-21 22:02:52,830 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2021-12-21 22:02:52,830 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2021-12-21 22:02:52,830 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:02:52,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2021-12-21 22:02:52,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:02:52,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:52,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:52,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-21 22:02:52,832 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:52,832 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 [2021-12-21 22:02:52,832 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 [2021-12-21 22:02:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2021-12-21 22:02:52,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349116656] [2021-12-21 22:02:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:52,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2021-12-21 22:02:52,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:52,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842541011] [2021-12-21 22:02:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:52,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,892 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2021-12-21 22:02:52,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:52,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015063948] [2021-12-21 22:02:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:52,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:52,913 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:52,954 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:02:52,955 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:02:52,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:02:52,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:02:52,956 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:02:52,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:52,956 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:02:52,956 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:02:52,956 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2021-12-21 22:02:52,956 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:02:52,957 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:02:52,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:52,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:52,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:52,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:52,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:02:53,083 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:02:53,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:02:53,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:02:53,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,118 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:02:53,118 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: [] [2021-12-21 22:02:53,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:02:53,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:02:53,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:02:53,166 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: [] [2021-12-21 22:02:53,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:02:53,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:02:53,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:02:53,204 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: [] [2021-12-21 22:02:53,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:02:53,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:02:53,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,245 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:02:53,245 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: [] [2021-12-21 22:02:53,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 22:02:53,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:02:53,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,307 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 [2021-12-21 22:02:53,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 22:02:53,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:02:53,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:02:53,340 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:02:53,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,347 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:02:53,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:02:53,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:02:53,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:02:53,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:02:53,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:02:53,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:02:53,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2021-12-21 22:02:53,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:02:53,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:02:53,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:53,438 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:02:53,449 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:02:53,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 22:02:53,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:53,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:53,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:53,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:53,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:53,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:53,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:53,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:53,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-21 22:02:53,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 22:02:53,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:53,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:53,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:53,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:53,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:53,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:53,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:53,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:53,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,591 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-21 22:02:53,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:53,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:53,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:53,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:53,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:53,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:53,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:53,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:53,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:53,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,624 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-21 22:02:53,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:53,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:53,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:53,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:53,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:53,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:53,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:53,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:53,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,672 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-21 22:02:53,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:53,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:53,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:53,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:53,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:53,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:53,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:53,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:53,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:02:53,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 22:02:53,692 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 22:02:53,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:53,694 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:53,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-21 22:02:53,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:02:53,728 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 22:02:53,728 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:02:53,728 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 [] [2021-12-21 22:02:53,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:53,746 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 22:02:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:53,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:02:53,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:53,802 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:02:53,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:53,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:02:53,839 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) [2021-12-21 22:02:53,873 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. [2021-12-21 22:02:53,874 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 [2021-12-21 22:02:53,874 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) [2021-12-21 22:02:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2021-12-21 22:02:53,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-21 22:02:53,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:53,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-21 22:02:53,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:53,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-21 22:02:53,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:53,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2021-12-21 22:02:53,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:53,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2021-12-21 22:02:53,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-21 22:02:53,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-21 22:02:53,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2021-12-21 22:02:53,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:02:53,882 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2021-12-21 22:02:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2021-12-21 22:02:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-21 22:02:53,883 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) [2021-12-21 22:02:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2021-12-21 22:02:53,884 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2021-12-21 22:02:53,884 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2021-12-21 22:02:53,884 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:02:53,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2021-12-21 22:02:53,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:53,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:53,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:53,886 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:02:53,886 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:53,886 INFO L791 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 100#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; 108#L562 assume !(main_~array_size~0#1 < 1); 109#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; 110#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 102#L551-3 [2021-12-21 22:02:53,886 INFO L793 eck$LassoCheckResult]: Loop: 102#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); 105#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); 101#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 102#L551-3 [2021-12-21 22:02:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2021-12-21 22:02:53,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:53,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778552491] [2021-12-21 22:02:53,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:53,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2021-12-21 22:02:53,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:53,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039148240] [2021-12-21 22:02:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:53,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,949 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2021-12-21 22:02:53,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:53,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068270796] [2021-12-21 22:02:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:53,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:53,978 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:54,227 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:02:54,228 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:02:54,228 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:02:54,228 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:02:54,228 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:02:54,228 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:02:54,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:02:54,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2021-12-21 22:02:54,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:02:54,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:02:54,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-21 22:02:54,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:54,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:02:54,717 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:02:54,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:54,752 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:54,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-21 22:02:54,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:54,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:54,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:54,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:54,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:54,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:54,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:54,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:54,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:54,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:54,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:54,824 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:54,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-21 22:02:54,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:54,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:54,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:54,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:54,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:54,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:54,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:54,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:54,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:54,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:54,872 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:02:54,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-21 22:02:54,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:54,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:54,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:54,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:54,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:54,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:54,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:54,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:54,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:54,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:54,925 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) [2021-12-21 22:02:54,932 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 [2021-12-21 22:02:54,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:54,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:54,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:54,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:54,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:54,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:54,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:54,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:54,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:54,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:54,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:54,963 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) [2021-12-21 22:02:54,963 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 [2021-12-21 22:02:54,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:54,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:54,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:54,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:54,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:54,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:54,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:54,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,003 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 [2021-12-21 22:02:55,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,004 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) [2021-12-21 22:02:55,005 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 [2021-12-21 22:02:55,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:55,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:55,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:55,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,040 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 [2021-12-21 22:02:55,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,042 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) [2021-12-21 22:02:55,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:55,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:55,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:55,058 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 [2021-12-21 22:02:55,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-21 22:02:55,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,092 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) [2021-12-21 22:02:55,092 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 [2021-12-21 22:02:55,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:55,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:55,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:55,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,122 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 [2021-12-21 22:02:55,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,123 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) [2021-12-21 22:02:55,124 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 [2021-12-21 22:02:55,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:02:55,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:02:55,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:02:55,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-21 22:02:55,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,165 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) [2021-12-21 22:02:55,166 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 [2021-12-21 22:02:55,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:55,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:55,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,229 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 [2021-12-21 22:02:55,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,231 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) [2021-12-21 22:02:55,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:55,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:55,259 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 [2021-12-21 22:02:55,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:02:55,295 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 [2021-12-21 22:02:55,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,296 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) [2021-12-21 22:02:55,297 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 [2021-12-21 22:02:55,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:02:55,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:02:55,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:02:55,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:02:55,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:02:55,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:02:55,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:02:55,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:02:55,341 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-21 22:02:55,341 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-21 22:02:55,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,343 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) [2021-12-21 22:02:55,344 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 [2021-12-21 22:02:55,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:02:55,384 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:02:55,384 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:02:55,384 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 [] [2021-12-21 22:02:55,403 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 [2021-12-21 22:02:55,412 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-21 22:02:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:55,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:02:55,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:55,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:02:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:55,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:02:55,471 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) [2021-12-21 22:02:55,491 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. [2021-12-21 22:02:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:02:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:02:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-21 22:02:55,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-21 22:02:55,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:55,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2021-12-21 22:02:55,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:55,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-21 22:02:55,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:02:55,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2021-12-21 22:02:55,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:55,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2021-12-21 22:02:55,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-21 22:02:55,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-21 22:02:55,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2021-12-21 22:02:55,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:02:55,506 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-21 22:02:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2021-12-21 22:02:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2021-12-21 22:02:55,507 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) [2021-12-21 22:02:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-12-21 22:02:55,507 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-21 22:02:55,507 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-21 22:02:55,508 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:02:55,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-12-21 22:02:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:55,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-21 22:02:55,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:55,510 INFO L791 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 205#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; 213#L562 assume !(main_~array_size~0#1 < 1); 214#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; 215#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 209#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 211#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 216#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 207#L551-3 [2021-12-21 22:02:55,510 INFO L793 eck$LassoCheckResult]: Loop: 207#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); 210#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); 206#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 207#L551-3 [2021-12-21 22:02:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2021-12-21 22:02:55,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:55,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093021533] [2021-12-21 22:02:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:55,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:02:55,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093021533] [2021-12-21 22:02:55,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093021533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:02:55,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:02:55,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:02:55,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31453630] [2021-12-21 22:02:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:02:55,542 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:02:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2021-12-21 22:02:55,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989231870] [2021-12-21 22:02:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:55,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:02:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:02:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:02:55,644 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) [2021-12-21 22:02:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:02:55,670 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2021-12-21 22:02:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:02:55,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2021-12-21 22:02:55,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:55,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2021-12-21 22:02:55,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-21 22:02:55,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-21 22:02:55,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2021-12-21 22:02:55,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:02:55,679 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-21 22:02:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2021-12-21 22:02:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2021-12-21 22:02:55,680 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) [2021-12-21 22:02:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-21 22:02:55,682 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-21 22:02:55,682 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-21 22:02:55,682 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:02:55,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-21 22:02:55,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:55,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:55,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:55,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:02:55,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:55,684 INFO L791 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#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; 259#L562 assume !(main_~array_size~0#1 < 1); 260#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; 261#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 257#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); 258#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 254#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 255#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 263#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 262#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 253#L551-3 [2021-12-21 22:02:55,684 INFO L793 eck$LassoCheckResult]: Loop: 253#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); 256#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); 252#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 253#L551-3 [2021-12-21 22:02:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2021-12-21 22:02:55,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:55,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689893317] [2021-12-21 22:02:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2021-12-21 22:02:55,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:55,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205868057] [2021-12-21 22:02:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:55,711 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2021-12-21 22:02:55,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:55,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131375817] [2021-12-21 22:02:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:55,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:02:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131375817] [2021-12-21 22:02:55,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131375817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:02:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554020723] [2021-12-21 22:02:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:55,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:02:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:55,752 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) [2021-12-21 22:02:55,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-21 22:02:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:55,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:02:55,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:55,817 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 [2021-12-21 22:02:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:55,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:02:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:55,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554020723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:02:55,890 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:02:55,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2021-12-21 22:02:55,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819025631] [2021-12-21 22:02:55,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:02:55,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:02:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 22:02:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-21 22:02:55,953 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) [2021-12-21 22:02:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:02:56,003 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-21 22:02:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 22:02:56,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-12-21 22:02:56,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:56,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2021-12-21 22:02:56,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:02:56,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:02:56,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2021-12-21 22:02:56,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:02:56,005 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-12-21 22:02:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2021-12-21 22:02:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2021-12-21 22:02:56,006 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) [2021-12-21 22:02:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2021-12-21 22:02:56,006 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2021-12-21 22:02:56,006 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2021-12-21 22:02:56,006 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:02:56,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2021-12-21 22:02:56,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:56,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:56,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:56,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-21 22:02:56,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:56,007 INFO L791 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 390#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; 398#L562 assume !(main_~array_size~0#1 < 1); 399#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; 400#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 396#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); 397#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 393#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 394#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); 404#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 405#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 403#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 402#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 401#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 392#L551-3 [2021-12-21 22:02:56,007 INFO L793 eck$LassoCheckResult]: Loop: 392#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); 395#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); 391#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 392#L551-3 [2021-12-21 22:02:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2021-12-21 22:02:56,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34066559] [2021-12-21 22:02:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2021-12-21 22:02:56,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388232963] [2021-12-21 22:02:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,032 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2021-12-21 22:02:56,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406231195] [2021-12-21 22:02:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:02:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:02:56,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:02:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406231195] [2021-12-21 22:02:56,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406231195] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:02:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018633068] [2021-12-21 22:02:56,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:02:56,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:02:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:02:56,236 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) [2021-12-21 22:02:56,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-21 22:02:56,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:02:56,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:02:56,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 22:02:56,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:02:56,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:02:56,391 INFO L387 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 [2021-12-21 22:02:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 22:02:56,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:02:56,485 INFO L353 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2021-12-21 22:02:56,485 INFO L387 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 [2021-12-21 22:02:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 22:02:56,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018633068] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:02:56,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:02:56,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2021-12-21 22:02:56,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291150307] [2021-12-21 22:02:56,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:02:56,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:02:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 22:02:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-21 22:02:56,627 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) [2021-12-21 22:02:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:02:56,705 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-12-21 22:02:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 22:02:56,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2021-12-21 22:02:56,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-21 22:02:56,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2021-12-21 22:02:56,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-21 22:02:56,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-21 22:02:56,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2021-12-21 22:02:56,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:02:56,708 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2021-12-21 22:02:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2021-12-21 22:02:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2021-12-21 22:02:56,709 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) [2021-12-21 22:02:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-21 22:02:56,709 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-21 22:02:56,709 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-21 22:02:56,709 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:02:56,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-12-21 22:02:56,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-21 22:02:56,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:02:56,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:02:56,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:02:56,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:02:56,711 INFO L791 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 563#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; 571#L562 assume !(main_~array_size~0#1 < 1); 572#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; 573#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 574#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); 584#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 566#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 567#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); 570#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); 577#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 583#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 579#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 580#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 565#L551-3 [2021-12-21 22:02:56,711 INFO L793 eck$LassoCheckResult]: Loop: 565#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); 587#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); 564#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 565#L551-3 [2021-12-21 22:02:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2021-12-21 22:02:56,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104068036] [2021-12-21 22:02:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2021-12-21 22:02:56,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572859308] [2021-12-21 22:02:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:02:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2021-12-21 22:02:56,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:02:56,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013348103] [2021-12-21 22:02:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:02:56,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:02:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:02:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:02:56,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:02:57,218 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:02:57,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:02:57,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:02:57,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:02:57,219 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:02:57,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:02:57,219 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:02:57,219 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:02:57,219 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2021-12-21 22:02:57,219 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:02:57,219 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:02:57,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:57,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:57,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:02:57,260 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-21 22:02:57,262 INFO L158 Benchmark]: Toolchain (without parser) took 5462.34ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 51.8MB in the beginning and 84.8MB in the end (delta: -33.1MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2021-12-21 22:02:57,262 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:02:57,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.13ms. Allocated memory is still 83.9MB. Free memory was 51.6MB in the beginning and 54.9MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 22:02:57,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.20ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 53.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:02:57,263 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 52.2MB in the end (delta: 971.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 22:02:57,263 INFO L158 Benchmark]: RCFGBuilder took 256.50ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 42.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 22:02:57,263 INFO L158 Benchmark]: BuchiAutomizer took 4799.42ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 42.0MB in the beginning and 84.8MB in the end (delta: -42.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2021-12-21 22:02:57,264 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.13ms. Allocated memory is still 83.9MB. Free memory was 51.6MB in the beginning and 54.9MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.20ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 53.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 52.2MB in the end (delta: 971.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 256.50ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 42.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4799.42ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 42.0MB in the beginning and 84.8MB in the end (delta: -42.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 22:02:57,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-21 22:02:57,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-12-21 22:02:57,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null