./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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-?-6c24879 [2022-07-13 03:19:31,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:19:31,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:19:31,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:19:31,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:19:31,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:19:31,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:19:31,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:19:31,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:19:31,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:19:31,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:19:31,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:19:31,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:19:31,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:19:31,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:19:31,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:19:31,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:19:31,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:19:31,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:19:31,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:19:31,424 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:19:31,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:19:31,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:19:31,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:19:31,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:19:31,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:19:31,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:19:31,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:19:31,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:19:31,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:19:31,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:19:31,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:19:31,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:19:31,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:19:31,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:19:31,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:19:31,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:19:31,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:19:31,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:19:31,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:19:31,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:19:31,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:19:31,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:19:31,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:19:31,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:19:31,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:19:31,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:19:31,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:19:31,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:19:31,466 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:19:31,467 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:19:31,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:19:31,467 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:19:31,468 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:19:31,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:19:31,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:19:31,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:19:31,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:19:31,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:19:31,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:19:31,470 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:19:31,470 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f [2022-07-13 03:19:31,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:19:31,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:19:31,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:19:31,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:19:31,649 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:19:31,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-07-13 03:19:31,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e72844ce/5a114c8fedb34a6f90c3b4e608db6ea0/FLAGae64b8116 [2022-07-13 03:19:32,107 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:19:32,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-07-13 03:19:32,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e72844ce/5a114c8fedb34a6f90c3b4e608db6ea0/FLAGae64b8116 [2022-07-13 03:19:32,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e72844ce/5a114c8fedb34a6f90c3b4e608db6ea0 [2022-07-13 03:19:32,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:19:32,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:19:32,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:19:32,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:19:32,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:19:32,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713ffefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32, skipping insertion in model container [2022-07-13 03:19:32,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:19:32,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:19:32,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:19:32,377 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:19:32,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:19:32,428 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:19:32,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32 WrapperNode [2022-07-13 03:19:32,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:19:32,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:19:32,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:19:32,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:19:32,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,460 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-13 03:19:32,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:19:32,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:19:32,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:19:32,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:19:32,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:19:32,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:19:32,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:19:32,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:19:32,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (1/1) ... [2022-07-13 03:19:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:32,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:32,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:19:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:19:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:19:32,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:19:32,634 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:19:32,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:19:32,743 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:19:32,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:19:32,747 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:19:32,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:32 BoogieIcfgContainer [2022-07-13 03:19:32,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:19:32,750 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:19:32,750 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:19:32,756 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:19:32,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:32,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:19:32" (1/3) ... [2022-07-13 03:19:32,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f74a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:19:32, skipping insertion in model container [2022-07-13 03:19:32,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:32,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:32" (2/3) ... [2022-07-13 03:19:32,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f74a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:19:32, skipping insertion in model container [2022-07-13 03:19:32,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:32,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:32" (3/3) ... [2022-07-13 03:19:32,759 INFO L354 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2022-07-13 03:19:32,802 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:19:32,803 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:19:32,803 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:19:32,803 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:19:32,803 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:19:32,803 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:19:32,804 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:19:32,804 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:19:32,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:32,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:19:32,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:32,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:32,823 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:32,824 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:32,824 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:19:32,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:32,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:19:32,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:32,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:32,826 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:32,826 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:32,831 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#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; 11#L562true assume !(main_~array_size~0#1 < 1); 13#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; 6#L550-3true [2022-07-13 03:19:32,831 INFO L754 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 5#L551-3true assume !true; 12#L550-2true bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 6#L550-3true [2022-07-13 03:19:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-13 03:19:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:32,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337826376] [2022-07-13 03:19:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:32,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:32,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2022-07-13 03:19:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:32,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486183669] [2022-07-13 03:19:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:33,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486183669] [2022-07-13 03:19:33,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486183669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:33,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:33,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:19:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298488772] [2022-07-13 03:19:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:33,017 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:19:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:19:33,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:19:33,045 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:33,050 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-07-13 03:19:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:19:33,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-07-13 03:19:33,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:19:33,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2022-07-13 03:19:33,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-13 03:19:33,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 03:19:33,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-07-13 03:19:33,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:19:33,069 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-13 03:19:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-07-13 03:19:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-13 03:19:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-07-13 03:19:33,088 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-13 03:19:33,089 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-13 03:19:33,089 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:19:33,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-07-13 03:19:33,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:19:33,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:33,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:33,090 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:33,090 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:33,090 INFO L752 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 40#L562 assume !(main_~array_size~0#1 < 1); 41#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 42#L550-3 [2022-07-13 03:19:33,091 INFO L754 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 37#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 38#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 42#L550-3 [2022-07-13 03:19:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-13 03:19:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:33,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774844486] [2022-07-13 03:19:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:33,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2022-07-13 03:19:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:33,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557882323] [2022-07-13 03:19:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2022-07-13 03:19:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:33,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063596533] [2022-07-13 03:19:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:33,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:33,219 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:33,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:33,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:33,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:33,220 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:19:33,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:33,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:33,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-07-13 03:19:33,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:33,221 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:33,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:33,322 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:19:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:19:33,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:19:33,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:19:33,354 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:19:33,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:19:33,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:19:33,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,402 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:19:33,402 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:19:33,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:19:33,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:19:33,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:19:33,452 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:19:33,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:19:33,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:19:33,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:19:33,495 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_ALL_1=0} Honda state: {v_rep~unnamed0~0~P_ALL_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:19:33,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:19:33,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:19:33,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-13 03:19:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:19:33,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:19:33,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:19:33,580 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:19:33,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,584 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:33,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:33,584 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:33,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:33,584 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:33,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:33,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:33,584 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-07-13 03:19:33,584 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:33,584 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:33,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:33,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:33,659 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:19:33,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:19:33,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:33,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:33,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:33,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:33,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:33,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:33,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:33,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:33,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:19:33,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:33,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:33,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:33,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:33,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:33,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:33,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:33,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:33,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 03:19:33,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:33,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:33,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:33,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:33,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:33,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:33,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:33,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:33,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:33,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,798 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 03:19:33,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:33,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:33,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:33,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:33,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:33,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:33,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:33,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:33,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 03:19:33,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:33,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:33,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:33,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:33,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:33,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:33,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:33,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:33,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:19:33,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:19:33,884 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:19:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:33,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:33,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:33,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:19:33,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:19:33,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:19:33,889 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:19:33,889 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-07-13 03:19:33,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:33,910 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:19:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:33,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:33,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:33,977 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:19:33,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:34,000 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:19:34,000 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:34,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 22 transitions. Complement of second has 4 states. [2022-07-13 03:19:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:19:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-07-13 03:19:34,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-13 03:19:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:34,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-13 03:19:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:34,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-13 03:19:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:34,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2022-07-13 03:19:34,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:34,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2022-07-13 03:19:34,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:19:34,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 03:19:34,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-07-13 03:19:34,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:34,028 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-07-13 03:19:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-07-13 03:19:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-13 03:19:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2022-07-13 03:19:34,029 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-07-13 03:19:34,029 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-07-13 03:19:34,029 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:19:34,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2022-07-13 03:19:34,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:34,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:34,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:34,029 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:19:34,030 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:34,030 INFO L752 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 [2022-07-13 03:19:34,030 INFO L754 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 [2022-07-13 03:19:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-07-13 03:19:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:34,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057486404] [2022-07-13 03:19:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2022-07-13 03:19:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068376402] [2022-07-13 03:19:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:34,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2022-07-13 03:19:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:34,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756207672] [2022-07-13 03:19:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:34,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:34,382 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:34,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:34,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:34,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:34,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:34,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:34,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:34,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2022-07-13 03:19:34,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:34,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:34,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:34,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:34,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:19:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:19:34,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:34,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:34,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:34,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:34,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:34,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:34,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:34,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:34,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:34,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,823 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:19:34,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:34,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:34,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:34,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:34,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:34,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:34,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:34,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:34,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-13 03:19:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:19:34,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:34,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:34,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:34,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:34,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:34,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:34,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:34,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:34,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-13 03:19:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,911 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 03:19:34,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:34,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:34,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:34,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:34,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:34,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:34,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:34,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:34,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:34,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,944 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 03:19:34,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:34,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:34,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:34,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:34,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:34,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:34,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:34,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:34,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:34,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:34,998 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:34,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 03:19:35,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:35,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:35,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:35,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,025 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:19:35,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:35,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:35,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:35,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:35,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,053 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:19:35,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:35,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:35,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:35,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:35,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,086 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:19:35,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:35,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:35,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:35,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,112 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 [2022-07-13 03:19:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,114 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:19:35,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:35,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:35,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 03:19:35,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,167 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:19:35,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:35,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:35,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:35,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 03:19:35,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,207 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 03:19:35,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:19:35,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:35,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:35,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:35,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:35,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:35,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:35,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:19:35,279 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-13 03:19:35,279 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-13 03:19:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,281 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:19:35,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:19:35,289 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:19:35,290 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:19:35,290 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~i~0#1) = -2*ULTIMATE.start_bubbleSort_~j~0#1 + 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-07-13 03:19:35,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-13 03:19:35,334 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-13 03:19:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:35,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:35,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:19:35,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:35,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:19:35,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 41 transitions. Complement of second has 7 states. [2022-07-13 03:19:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:19:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-13 03:19:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-13 03:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-13 03:19:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-13 03:19:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:35,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2022-07-13 03:19:35,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2022-07-13 03:19:35,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:19:35,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 03:19:35,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-07-13 03:19:35,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:35,418 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-13 03:19:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-07-13 03:19:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-07-13 03:19:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-07-13 03:19:35,420 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-13 03:19:35,420 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-13 03:19:35,420 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:19:35,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-07-13 03:19:35,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:35,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:35,420 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:35,420 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:35,420 INFO L752 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 [2022-07-13 03:19:35,420 INFO L754 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 [2022-07-13 03:19:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2022-07-13 03:19:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134195998] [2022-07-13 03:19:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134195998] [2022-07-13 03:19:35,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134195998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:35,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:35,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:19:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922933054] [2022-07-13 03:19:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:35,462 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:19:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,462 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2022-07-13 03:19:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265265485] [2022-07-13 03:19:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:19:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:19:35,538 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:35,562 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-07-13 03:19:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:19:35,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-07-13 03:19:35,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-07-13 03:19:35,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:19:35,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:19:35,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-13 03:19:35,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:35,564 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 03:19:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-13 03:19:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2022-07-13 03:19:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-13 03:19:35,565 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 03:19:35,565 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-13 03:19:35,565 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:19:35,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-13 03:19:35,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:35,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:35,566 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:35,566 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:35,566 INFO L752 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 [2022-07-13 03:19:35,566 INFO L754 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 [2022-07-13 03:19:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2022-07-13 03:19:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488021084] [2022-07-13 03:19:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2022-07-13 03:19:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879470034] [2022-07-13 03:19:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2022-07-13 03:19:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374075845] [2022-07-13 03:19:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:35,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374075845] [2022-07-13 03:19:35,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374075845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:19:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515054700] [2022-07-13 03:19:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:35,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:35,708 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:35,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-13 03:19:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:35,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:19:35,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:35,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:19:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:35,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515054700] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:19:35,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:19:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-13 03:19:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222024318] [2022-07-13 03:19:35,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:19:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 03:19:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 03:19:35,861 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:35,934 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-13 03:19:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:19:35,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-07-13 03:19:35,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2022-07-13 03:19:35,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 03:19:35,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 03:19:35,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2022-07-13 03:19:35,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:35,939 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-07-13 03:19:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2022-07-13 03:19:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-07-13 03:19:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-13 03:19:35,943 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 03:19:35,943 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 03:19:35,943 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:19:35,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-13 03:19:35,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:35,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:35,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:35,945 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:35,945 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:35,945 INFO L752 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 [2022-07-13 03:19:35,945 INFO L754 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 [2022-07-13 03:19:35,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2022-07-13 03:19:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983065129] [2022-07-13 03:19:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2022-07-13 03:19:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:35,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210591189] [2022-07-13 03:19:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:35,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:35,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2022-07-13 03:19:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485888187] [2022-07-13 03:19:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485888187] [2022-07-13 03:19:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485888187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:19:36,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138786579] [2022-07-13 03:19:36,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:19:36,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:36,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:36,208 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-13 03:19:36,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:19:36,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:19:36,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 03:19:36,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:36,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:19:36,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-13 03:19:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 03:19:36,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:19:36,433 INFO L356 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2022-07-13 03:19:36,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 32 [2022-07-13 03:19:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 03:19:36,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138786579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:19:36,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:19:36,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2022-07-13 03:19:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810570708] [2022-07-13 03:19:36,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:19:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 03:19:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-07-13 03:19:36,556 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:36,644 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-13 03:19:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 03:19:36,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2022-07-13 03:19:36,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:19:36,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2022-07-13 03:19:36,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 03:19:36,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 03:19:36,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2022-07-13 03:19:36,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:36,647 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-13 03:19:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2022-07-13 03:19:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-07-13 03:19:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-07-13 03:19:36,650 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-13 03:19:36,650 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-13 03:19:36,650 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:19:36,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-07-13 03:19:36,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:19:36,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:36,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:36,651 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:36,651 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:19:36,651 INFO L752 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 [2022-07-13 03:19:36,651 INFO L754 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 [2022-07-13 03:19:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2022-07-13 03:19:36,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:36,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030948554] [2022-07-13 03:19:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2022-07-13 03:19:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694302649] [2022-07-13 03:19:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2022-07-13 03:19:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:36,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902541435] [2022-07-13 03:19:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:36,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:37,136 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:37,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:37,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:37,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:37,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:37,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:37,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:37,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:37,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2022-07-13 03:19:37,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:37,137 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:37,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:37,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:37,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:19:37,179 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:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 03:19:37,188 INFO L158 Benchmark]: Toolchain (without parser) took 5058.97ms. Allocated memory was 90.2MB in the beginning and 146.8MB in the end (delta: 56.6MB). Free memory was 59.0MB in the beginning and 37.2MB in the end (delta: 21.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-07-13 03:19:37,188 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:37,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.19ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 58.8MB in the beginning and 92.6MB in the end (delta: -33.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:19:37,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 121.6MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:19:37,189 INFO L158 Benchmark]: Boogie Preprocessor took 18.61ms. Allocated memory is still 121.6MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:37,189 INFO L158 Benchmark]: RCFGBuilder took 268.27ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 79.6MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:19:37,189 INFO L158 Benchmark]: BuchiAutomizer took 4437.82ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 79.2MB in the beginning and 37.2MB in the end (delta: 42.0MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-07-13 03:19:37,190 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.35ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.19ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 58.8MB in the beginning and 92.6MB in the end (delta: -33.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 121.6MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.61ms. Allocated memory is still 121.6MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.27ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 79.6MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4437.82ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 79.2MB in the beginning and 37.2MB in the end (delta: 42.0MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 03:19:37,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-13 03:19:37,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-13 03:19:37,634 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