./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.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 a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:43,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:43,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:43,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:43,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:43,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:43,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:43,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:43,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:43,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:43,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:43,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:43,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:43,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:43,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:43,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:43,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:43,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:43,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:43,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:43,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:43,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:43,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:43,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:43,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:43,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:43,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:43,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:43,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:43,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:43,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:43,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:43,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:43,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:43,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:43,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:43,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:43,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:43,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:43,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:43,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:43,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:43,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:43,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:43,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:43,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:43,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:43,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:43,727 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:43,727 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:43,727 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:43,727 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:43,728 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:43,728 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:43,728 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:43,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:43,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:43,730 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:43,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:43,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:43,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:43,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:43,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:43,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:43,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:43,732 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 -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2022-02-21 03:32:43,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:43,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:43,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:43,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:43,935 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:43,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2022-02-21 03:32:43,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072323d6/18ab3642717d409f858f2d49296348fa/FLAG2ed8edc2b [2022-02-21 03:32:44,399 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:44,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2022-02-21 03:32:44,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072323d6/18ab3642717d409f858f2d49296348fa/FLAG2ed8edc2b [2022-02-21 03:32:44,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072323d6/18ab3642717d409f858f2d49296348fa [2022-02-21 03:32:44,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:44,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:44,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:44,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:44,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:44,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42812d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44, skipping insertion in model container [2022-02-21 03:32:44,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:44,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:44,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:44,737 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:44,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:44,778 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:44,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44 WrapperNode [2022-02-21 03:32:44,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:44,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:44,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:44,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:44,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,835 INFO L137 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-02-21 03:32:44,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:44,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:44,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:44,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:44,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:44,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:44,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:44,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:44,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (1/1) ... [2022-02-21 03:32:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:44,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:32:44,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:44,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:45,030 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:45,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:45,210 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:45,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:45,218 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:32:45,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:45 BoogieIcfgContainer [2022-02-21 03:32:45,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:45,220 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:45,220 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:45,233 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:45,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:45,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:44" (1/3) ... [2022-02-21 03:32:45,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207ae6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:45, skipping insertion in model container [2022-02-21 03:32:45,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:45,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:44" (2/3) ... [2022-02-21 03:32:45,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207ae6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:45, skipping insertion in model container [2022-02-21 03:32:45,236 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:45,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:45" (3/3) ... [2022-02-21 03:32:45,237 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2022-02-21 03:32:45,275 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:45,276 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:45,276 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:45,276 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:45,276 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:45,276 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:45,276 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:45,276 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:45,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:45,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:32:45,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:45,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:45,305 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:45,305 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:45,306 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:45,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:45,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:32:45,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:45,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:45,309 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:45,309 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:45,314 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 13#L558true assume !(main_~array_size~0#1 < 1); 8#L558-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;main_~i~1#1 := 0; 15#L562-3true [2022-02-21 03:32:45,314 INFO L793 eck$LassoCheckResult]: Loop: 15#L562-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17#L562-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15#L562-3true [2022-02-21 03:32:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:32:45,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:45,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081121383] [2022-02-21 03:32:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,408 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 03:32:45,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:45,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108358335] [2022-02-21 03:32:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 03:32:45,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:45,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952383] [2022-02-21 03:32:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:45,515 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:45,747 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:45,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:45,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:45,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:45,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:45,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:45,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:45,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2022-02-21 03:32:45,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:45,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:45,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:46,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:46,158 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:46,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:32:46,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:46,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:46,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:46,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:32:46,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:32:46,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:32:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:46,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:46,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:46,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:46,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:32:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:46,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:46,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:46,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:46,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:46,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:46,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:46,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,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-02-21 03:32:46,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:32:46,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,722 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:32:46,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:46,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:46,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:46,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:32:46,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:46,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:46,860 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:32:46,861 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 03:32:46,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,904 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:46,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:32:46,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:46,928 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:32:46,928 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:46,928 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2022-02-21 03:32:46,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,991 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:32:47,001 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1;" "main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 03:32:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:32:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:47,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 03:32:47,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {26#unseeded} is VALID [2022-02-21 03:32:47,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0#1 < 1); {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} is VALID [2022-02-21 03:32:47,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} 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;main_~i~1#1 := 0; {60#(and unseeded (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 03:32:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:32:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:47,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {79#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 03:32:47,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {63#(and (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|)))) unseeded))} is VALID [2022-02-21 03:32:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:47,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:47,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:32:47,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 35 states and 53 transitions. Complement of second has 9 states. [2022-02-21 03:32:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:47,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:47,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:32:47,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:47,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2022-02-21 03:32:47,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:47,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:32:47,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:32:47,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:47,280 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:47,280 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 03:32:47,280 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:47,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:47,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:47,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:47,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:47,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:47,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:47,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:47,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:47,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:47,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:47,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:47,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:47,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:32:47,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:32:47,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:32:47,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:47,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:47,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:47,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:47,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:47,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,300 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 03:32:47,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:32:47,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:47,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:47,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:47,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 03:32:47,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:47,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2022-02-21 03:32:47,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:47,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:47,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 03:32:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:47,310 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 03:32:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:32:47,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:47,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,325 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,326 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,328 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:32:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:32:47,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:32:47,329 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:32:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,330 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:32:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:32:47,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:47,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:32:47,332 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:47,332 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:47,332 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:47,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:32:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:47,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,333 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:47,333 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:47,333 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 135#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 138#L558 assume !(main_~array_size~0#1 < 1); 139#L558-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;main_~i~1#1 := 0; 142#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 132#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 133#L550-3 [2022-02-21 03:32:47,333 INFO L793 eck$LassoCheckResult]: Loop: 133#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 137#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 140#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 133#L550-3 [2022-02-21 03:32:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 03:32:47,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798842083] [2022-02-21 03:32:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {174#true} is VALID [2022-02-21 03:32:47,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {174#true} is VALID [2022-02-21 03:32:47,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !(main_~array_size~0#1 < 1); {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:32:47,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} 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;main_~i~1#1 := 0; {177#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 03:32:47,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {175#false} is VALID [2022-02-21 03:32:47,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {175#false} is VALID [2022-02-21 03:32:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:47,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:47,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798842083] [2022-02-21 03:32:47,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798842083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:47,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:47,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:47,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080582989] [2022-02-21 03:32:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:47,376 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2022-02-21 03:32:47,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577957348] [2022-02-21 03:32:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {180#(<= (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1| 1) |ULTIMATE.start_sort_~n#1|)} is VALID [2022-02-21 03:32:47,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(<= (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1| 1) |ULTIMATE.start_sort_~n#1|)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {179#false} is VALID [2022-02-21 03:32:47,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {179#false} is VALID [2022-02-21 03:32:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:47,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:47,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577957348] [2022-02-21 03:32:47,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577957348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:47,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:47,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:47,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708610103] [2022-02-21 03:32:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:47,427 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:47,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:32:47,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:32:47,431 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,452 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:32:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:32:47,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:47,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:47,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:32:47,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:32:47,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:47,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:47,457 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:32:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:32:47,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:47,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,458 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,458 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,459 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:32:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:32:47,459 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:32:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,460 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:32:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:47,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:32:47,462 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:32:47,462 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:32:47,462 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:47,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:32:47,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:47,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:47,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:47,463 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 198#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 201#L558 assume !(main_~array_size~0#1 < 1); 202#L558-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;main_~i~1#1 := 0; 205#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 195#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 196#L550-3 [2022-02-21 03:32:47,463 INFO L793 eck$LassoCheckResult]: Loop: 196#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 203#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 204#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 199#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 200#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 208#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 196#L550-3 [2022-02-21 03:32:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2022-02-21 03:32:47,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970772095] [2022-02-21 03:32:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {240#true} is VALID [2022-02-21 03:32:47,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {240#true} is VALID [2022-02-21 03:32:47,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume !(main_~array_size~0#1 < 1); {242#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:32:47,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} 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;main_~i~1#1 := 0; {243#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 03:32:47,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {241#false} is VALID [2022-02-21 03:32:47,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#false} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {241#false} is VALID [2022-02-21 03:32:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:47,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:47,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970772095] [2022-02-21 03:32:47,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970772095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:47,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:47,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:47,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135239827] [2022-02-21 03:32:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:47,491 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2022-02-21 03:32:47,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174739039] [2022-02-21 03:32:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,507 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:47,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:32:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:32:47,611 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,643 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:32:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:32:47,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:47,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-02-21 03:32:47,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:47,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 03:32:47,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:32:47,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:47,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-02-21 03:32:47,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:47,650 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:32:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-02-21 03:32:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:32:47,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:47,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,651 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,651 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,651 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:32:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:32:47,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 15 states and 19 transitions. [2022-02-21 03:32:47,652 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 15 states and 19 transitions. [2022-02-21 03:32:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:47,653 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:32:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:32:47,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:47,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:47,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:47,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-02-21 03:32:47,654 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 03:32:47,654 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 03:32:47,654 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:47,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-02-21 03:32:47,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:47,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:47,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:47,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:47,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:47,655 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 264#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 267#L558 assume !(main_~array_size~0#1 < 1); 268#L558-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;main_~i~1#1 := 0; 271#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 272#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 273#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 261#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 262#L550-3 [2022-02-21 03:32:47,655 INFO L793 eck$LassoCheckResult]: Loop: 262#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 269#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 270#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 265#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 266#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 274#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 262#L550-3 [2022-02-21 03:32:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 03:32:47,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572484715] [2022-02-21 03:32:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2022-02-21 03:32:47,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877095092] [2022-02-21 03:32:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:47,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2022-02-21 03:32:47,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:47,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581688120] [2022-02-21 03:32:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 03:32:47,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {312#true} is VALID [2022-02-21 03:32:47,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1); {312#true} is VALID [2022-02-21 03:32:47,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:47,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:47,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {315#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| 4)) (+ 4 (* |ULTIMATE.start_main_~array_size~0#1| 4))))} is VALID [2022-02-21 03:32:47,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| 4)) (+ 4 (* |ULTIMATE.start_main_~array_size~0#1| 4))))} assume !(main_~i~1#1 < main_~array_size~0#1); {316#(and (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) 4) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:47,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(and (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) 4) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {317#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} is VALID [2022-02-21 03:32:47,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {317#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {318#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} is VALID [2022-02-21 03:32:47,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:47,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:47,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 03:32:47,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 03:32:47,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 03:32:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:47,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:47,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581688120] [2022-02-21 03:32:47,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581688120] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:47,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76044867] [2022-02-21 03:32:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:47,816 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:47,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:32:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:32:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:47,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:47,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 03:32:47,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {312#true} is VALID [2022-02-21 03:32:47,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1); {312#true} is VALID [2022-02-21 03:32:47,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:47,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:47,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:47,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 03:32:47,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {346#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 1))} is VALID [2022-02-21 03:32:47,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {313#false} is VALID [2022-02-21 03:32:47,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#false} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:47,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:47,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 03:32:47,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 03:32:47,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 03:32:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:47,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:48,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 03:32:48,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 03:32:48,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 03:32:48,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:48,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#false} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 03:32:48,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(not (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {313#false} is VALID [2022-02-21 03:32:48,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {380#(not (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:48,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 03:32:48,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:48,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:48,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:48,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1); {312#true} is VALID [2022-02-21 03:32:48,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {312#true} is VALID [2022-02-21 03:32:48,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 03:32:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:48,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76044867] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:48,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:48,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-02-21 03:32:48,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670689864] [2022-02-21 03:32:48,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:48,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:32:48,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:32:48,177 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:48,392 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 03:32:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:32:48,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:48,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2022-02-21 03:32:48,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:48,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2022-02-21 03:32:48,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:32:48,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:48,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-02-21 03:32:48,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:48,415 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:32:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-02-21 03:32:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:32:48,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:48,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,416 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,416 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:48,417 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:32:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:32:48,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:48,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:48,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 20 transitions. [2022-02-21 03:32:48,418 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 20 transitions. [2022-02-21 03:32:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:48,418 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:32:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:32:48,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:48,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:48,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:48,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:32:48,420 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:32:48,420 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:32:48,420 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:48,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:32:48,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:48,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:48,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:48,421 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:48,421 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:48,421 INFO L791 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 436#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 439#L558 assume !(main_~array_size~0#1 < 1); 440#L558-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;main_~i~1#1 := 0; 443#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 444#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 445#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 446#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 448#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 433#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 434#L550-3 [2022-02-21 03:32:48,421 INFO L793 eck$LassoCheckResult]: Loop: 434#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 441#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 442#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 437#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 438#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 447#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 434#L550-3 [2022-02-21 03:32:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2022-02-21 03:32:48,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309355475] [2022-02-21 03:32:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,443 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2022-02-21 03:32:48,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522018287] [2022-02-21 03:32:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,455 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2022-02-21 03:32:48,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298621177] [2022-02-21 03:32:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,486 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:48,856 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:48,856 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:48,856 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:48,856 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:48,856 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:48,856 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:48,856 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:48,856 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:48,856 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration5_Lasso [2022-02-21 03:32:48,856 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:48,856 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:48,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,076 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:49,078 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:49,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:49,434 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:49,434 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:49,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:49,436 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:49,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:49,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:49,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:49,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:49,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:49,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:49,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:49,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:32:49,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:49,522 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 03:32:49,522 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-02-21 03:32:49,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:49,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:49,540 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:49,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:32:49,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:49,557 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:49,557 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:49,557 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2022-02-21 03:32:49,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:49,595 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:32:49,598 INFO L390 LassoCheck]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1;" [2022-02-21 03:32:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:49,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:49,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:49,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:49,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {492#unseeded} is VALID [2022-02-21 03:32:49,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {492#unseeded} is VALID [2022-02-21 03:32:49,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#unseeded} assume !(main_~array_size~0#1 < 1); {492#unseeded} is VALID [2022-02-21 03:32:49,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {492#unseeded} is VALID [2022-02-21 03:32:49,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {492#unseeded} is VALID [2022-02-21 03:32:49,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {492#unseeded} is VALID [2022-02-21 03:32:49,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {492#unseeded} is VALID [2022-02-21 03:32:49,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {492#unseeded} is VALID [2022-02-21 03:32:49,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {492#unseeded} is VALID [2022-02-21 03:32:49,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#unseeded} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {492#unseeded} is VALID [2022-02-21 03:32:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:49,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:49,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:49,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:49,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:49,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:49,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:49,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:49,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {535#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))))} is VALID [2022-02-21 03:32:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:49,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:49,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:49,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 states and 28 transitions. Complement of second has 4 states. [2022-02-21 03:32:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:49,741 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:49,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:49,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:49,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:49,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:49,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:49,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:49,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2022-02-21 03:32:49,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:49,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:49,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:49,747 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:49,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:32:49,750 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:49,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:49,751 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:49,752 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:49,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:49,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:49,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:32:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:32:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:32:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:32:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:32:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:32:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:49,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,767 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:32:49,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:49,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:32:49,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:32:49,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:49,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:49,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:49,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2022-02-21 03:32:49,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:49,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:49,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-02-21 03:32:49,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:49,772 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:32:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-02-21 03:32:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 03:32:49,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:49,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,773 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,773 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,774 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:49,776 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:32:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:32:49,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:49,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:49,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 21 states and 27 transitions. [2022-02-21 03:32:49,777 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 21 states and 27 transitions. [2022-02-21 03:32:49,777 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:49,778 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:32:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:32:49,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:49,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:49,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:49,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-21 03:32:49,779 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:32:49,779 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:32:49,779 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:32:49,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:32:49,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:49,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:49,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:49,781 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:49,781 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:49,781 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 614#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 619#L558 assume !(main_~array_size~0#1 < 1); 620#L558-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;main_~i~1#1 := 0; 625#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 626#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 627#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 628#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 630#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 611#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 612#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 616#L551-3 [2022-02-21 03:32:49,781 INFO L793 eck$LassoCheckResult]: Loop: 616#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 621#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 615#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 616#L551-3 [2022-02-21 03:32:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2022-02-21 03:32:49,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655643389] [2022-02-21 03:32:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,829 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2022-02-21 03:32:49,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484169640] [2022-02-21 03:32:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,840 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2022-02-21 03:32:49,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815265846] [2022-02-21 03:32:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:50,221 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:50,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:50,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:50,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:50,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:50,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:50,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:50,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2022-02-21 03:32:50,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:50,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:50,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,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-02-21 03:32:50,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,543 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:50,544 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:50,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:50,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:50,936 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:50,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,938 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:32:50,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:50,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:50,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,989 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:32:50,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:50,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:50,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:50,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:51,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,045 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-02-21 03:32:51,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,057 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:32:51,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:51,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:51,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:51,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,128 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:32:51,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,172 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:32:51,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:51,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:51,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:51,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,208 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:32:51,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:51,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:51,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:51,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,242 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:32:51,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,281 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:32:51,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,321 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-02-21 03:32:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,323 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:32:51,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,369 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:32:51,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,408 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:32:51,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:51,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:51,498 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 03:32:51,498 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-02-21 03:32:51,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,499 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:32:51,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:51,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:51,515 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:51,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = -1*ULTIMATE.start_sort_~i~0#1 + 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2022-02-21 03:32:51,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:32:51,561 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 03:32:51,572 INFO L390 LassoCheck]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1;" [2022-02-21 03:32:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {742#unseeded} is VALID [2022-02-21 03:32:51,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {742#unseeded} is VALID [2022-02-21 03:32:51,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#unseeded} assume !(main_~array_size~0#1 < 1); {742#unseeded} is VALID [2022-02-21 03:32:51,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {742#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {742#unseeded} is VALID [2022-02-21 03:32:51,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {742#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {742#unseeded} is VALID [2022-02-21 03:32:51,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {742#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {742#unseeded} is VALID [2022-02-21 03:32:51,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {742#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {742#unseeded} is VALID [2022-02-21 03:32:51,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {742#unseeded} is VALID [2022-02-21 03:32:51,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {742#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {742#unseeded} is VALID [2022-02-21 03:32:51,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {742#unseeded} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {742#unseeded} is VALID [2022-02-21 03:32:51,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {742#unseeded} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {742#unseeded} is VALID [2022-02-21 03:32:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* (- 1) |ULTIMATE.start_sort_~i~0#1|)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:51,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:51,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {790#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* (- 1) |ULTIMATE.start_sort_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:32:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:51,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:51,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,681 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:51,682 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Result 36 states and 50 transitions. Complement of second has 7 states. [2022-02-21 03:32:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:51,724 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:51,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:51,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:51,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 50 transitions. [2022-02-21 03:32:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:51,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:51,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:51,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:51,727 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:51,727 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:51,727 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:32:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:32:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:32:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:32:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:32:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:32:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:32:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:32:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,736 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 03:32:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:32:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:32:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:51,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:51,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2022-02-21 03:32:51,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:51,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:51,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2022-02-21 03:32:51,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:51,739 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-21 03:32:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2022-02-21 03:32:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2022-02-21 03:32:51,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:51,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,740 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,741 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,741 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:51,742 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:32:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:32:51,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:51,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:51,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 26 states and 34 transitions. [2022-02-21 03:32:51,742 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 26 states and 34 transitions. [2022-02-21 03:32:51,743 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:51,744 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:32:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:32:51,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:51,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:51,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:51,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 03:32:51,745 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:32:51,745 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:32:51,745 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:32:51,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:32:51,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:51,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,746 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:51,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:51,746 INFO L791 eck$LassoCheckResult]: Stem: 880#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 881#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 886#L558 assume !(main_~array_size~0#1 < 1); 887#L558-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;main_~i~1#1 := 0; 891#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 893#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 894#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 895#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 897#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 878#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 879#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 889#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 890#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 884#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 885#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 896#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 892#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 883#L551-3 [2022-02-21 03:32:51,746 INFO L793 eck$LassoCheckResult]: Loop: 883#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 888#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 882#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 883#L551-3 [2022-02-21 03:32:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2022-02-21 03:32:51,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:51,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037837287] [2022-02-21 03:32:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 03:32:51,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1037#true} is VALID [2022-02-21 03:32:51,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1); {1037#true} is VALID [2022-02-21 03:32:51,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1039#(and (<= 1 (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-21 03:32:51,800 INFO L290 TraceCheckUtils]: 4: Hoare triple {1039#(and (<= 1 (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1040#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:51,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:51,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:51,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 03:32:51,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 03:32:51,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:51,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 03:32:51,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 03:32:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:51,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:51,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037837287] [2022-02-21 03:32:51,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037837287] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:51,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089116654] [2022-02-21 03:32:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,809 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 03:32:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 03:32:51,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1037#true} is VALID [2022-02-21 03:32:51,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1); {1037#true} is VALID [2022-02-21 03:32:51,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:51,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:51,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:51,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:51,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 03:32:51,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 03:32:51,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1096#(and (<= 2 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 03:32:51,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#(and (<= 2 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 03:32:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:51,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:52,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 03:32:52,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 03:32:52,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 03:32:52,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 03:32:52,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:52,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 03:32:52,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:52,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:52,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1); {1037#true} is VALID [2022-02-21 03:32:52,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1037#true} is VALID [2022-02-21 03:32:52,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 03:32:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:52,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089116654] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:52,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:52,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-02-21 03:32:52,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004531840] [2022-02-21 03:32:52,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:52,096 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2022-02-21 03:32:52,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594130476] [2022-02-21 03:32:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,106 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:32:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:32:52,196 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:52,342 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 03:32:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:32:52,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:52,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-02-21 03:32:52,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:52,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2022-02-21 03:32:52,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:52,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:52,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-02-21 03:32:52,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:52,365 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 03:32:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-02-21 03:32:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-21 03:32:52,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:52,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,366 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,367 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,367 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:52,368 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 03:32:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:32:52,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 23 states and 28 transitions. [2022-02-21 03:32:52,368 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 23 states and 28 transitions. [2022-02-21 03:32:52,369 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:52,369 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 03:32:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:32:52,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:52,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:32:52,370 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:32:52,371 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:32:52,371 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:32:52,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:32:52,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:52,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,371 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:52,371 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:52,372 INFO L791 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1187#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 1192#L558 assume !(main_~array_size~0#1 < 1); 1193#L558-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;main_~i~1#1 := 0; 1198#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1199#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1200#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1201#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1203#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1205#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1204#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1184#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1185#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1195#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1196#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1190#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1191#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1202#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1197#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1189#L551-3 [2022-02-21 03:32:52,372 INFO L793 eck$LassoCheckResult]: Loop: 1189#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1194#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1188#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1189#L551-3 [2022-02-21 03:32:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2022-02-21 03:32:52,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210942457] [2022-02-21 03:32:52,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:52,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1356#true} is VALID [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1356#true} is VALID [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1); {1356#true} is VALID [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:52,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 03:32:52,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 03:32:52,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1360#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 03:32:52,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1360#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:32:52,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:32:52,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} assume !(main_~i~1#1 < main_~array_size~0#1); {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:32:52,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1362#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:52,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {1362#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:52,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:52,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:52,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1364#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= (+ |ULTIMATE.start_sort_~i~0#1| 2) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 03:32:52,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {1364#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= (+ |ULTIMATE.start_sort_~i~0#1| 2) |ULTIMATE.start_sort_~n#1|))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1357#false} is VALID [2022-02-21 03:32:52,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1357#false} is VALID [2022-02-21 03:32:52,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {1357#false} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 03:32:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:52,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:52,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210942457] [2022-02-21 03:32:52,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210942457] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:52,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595782289] [2022-02-21 03:32:52,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:32:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:52,480 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:52,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 03:32:52,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:32:52,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:32:52,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:32:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:52,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:52,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1356#true} is VALID [2022-02-21 03:32:52,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1356#true} is VALID [2022-02-21 03:32:52,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1); {1356#true} is VALID [2022-02-21 03:32:52,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1356#true} is VALID [2022-02-21 03:32:52,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1356#true} is VALID [2022-02-21 03:32:52,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1356#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1356#true} is VALID [2022-02-21 03:32:52,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} is VALID [2022-02-21 03:32:52,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 03:32:52,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 03:32:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:32:52,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:52,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 03:32:52,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 03:32:52,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 03:32:52,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} is VALID [2022-02-21 03:32:52,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {1356#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 03:32:52,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 03:32:52,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1356#true} is VALID [2022-02-21 03:32:52,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1); {1356#true} is VALID [2022-02-21 03:32:52,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1356#true} is VALID [2022-02-21 03:32:52,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1356#true} is VALID [2022-02-21 03:32:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:32:52,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595782289] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:52,690 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:52,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-02-21 03:32:52,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832897954] [2022-02-21 03:32:52,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:52,691 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2022-02-21 03:32:52,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050582312] [2022-02-21 03:32:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,700 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:32:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:32:52,779 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:53,165 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:32:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:32:53,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:53,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 03:32:53,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:53,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2022-02-21 03:32:53,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:32:53,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:32:53,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2022-02-21 03:32:53,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:53,185 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-02-21 03:32:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2022-02-21 03:32:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2022-02-21 03:32:53,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:53,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,187 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,187 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,187 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:53,188 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-21 03:32:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-21 03:32:53,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:53,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:53,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 43 states and 56 transitions. [2022-02-21 03:32:53,189 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 43 states and 56 transitions. [2022-02-21 03:32:53,189 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:53,190 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-21 03:32:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-21 03:32:53,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:53,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:53,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:53,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-21 03:32:53,191 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:32:53,191 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:32:53,191 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:32:53,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-02-21 03:32:53,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:53,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:53,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:53,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:53,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:53,192 INFO L791 eck$LassoCheckResult]: Stem: 1546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1547#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 1552#L558 assume !(main_~array_size~0#1 < 1); 1553#L558-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;main_~i~1#1 := 0; 1556#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1559#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1560#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1561#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1564#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1566#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1565#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1544#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1545#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1557#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1568#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1550#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1551#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1555#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1562#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1567#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1563#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1558#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1549#L551-3 [2022-02-21 03:32:53,193 INFO L793 eck$LassoCheckResult]: Loop: 1549#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1554#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1548#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1549#L551-3 [2022-02-21 03:32:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2022-02-21 03:32:53,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394601986] [2022-02-21 03:32:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,223 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2022-02-21 03:32:53,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169531120] [2022-02-21 03:32:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,231 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2022-02-21 03:32:53,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021353131] [2022-02-21 03:32:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 03:32:53,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1777#true} is VALID [2022-02-21 03:32:53,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1); {1777#true} is VALID [2022-02-21 03:32:53,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 03:32:53,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 03:32:53,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 03:32:53,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume !(main_~i~1#1 < main_~array_size~0#1); {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 03:32:53,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1782#(= |ULTIMATE.start_sort_~x#1.offset| 0)} is VALID [2022-02-21 03:32:53,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(= |ULTIMATE.start_sort_~x#1.offset| 0)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1783#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:53,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1784#(and (= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)) |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:53,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1784#(and (= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)) |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 03:32:53,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} is VALID [2022-02-21 03:32:53,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1787#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) |ULTIMATE.start_sort_#t~mem4#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0))} is VALID [2022-02-21 03:32:53,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1787#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) |ULTIMATE.start_sort_#t~mem4#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} is VALID [2022-02-21 03:32:53,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 03:32:53,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 03:32:53,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 03:32:53,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 03:32:53,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1789#(and (<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:53,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {1789#(and (<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 03:32:53,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 03:32:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:53,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:53,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021353131] [2022-02-21 03:32:53,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021353131] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:53,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768815545] [2022-02-21 03:32:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:53,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:53,496 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:53,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-21 03:32:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:32:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:53,731 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-21 03:32:53,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-02-21 03:32:53,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 03:32:53,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1777#true} is VALID [2022-02-21 03:32:53,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1); {1777#true} is VALID [2022-02-21 03:32:53,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:53,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {1777#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1777#true} is VALID [2022-02-21 03:32:53,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1777#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1777#true} is VALID [2022-02-21 03:32:53,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:53,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1834#(and (<= |ULTIMATE.start_sort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) |ULTIMATE.start_sort_#t~mem4#1|))} is VALID [2022-02-21 03:32:53,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {1834#(and (<= |ULTIMATE.start_sort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) |ULTIMATE.start_sort_#t~mem4#1|))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:53,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1860#(and (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 03:32:53,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {1860#(and (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} is VALID [2022-02-21 03:32:53,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 03:32:53,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 03:32:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:32:53,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:53,928 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-02-21 03:32:53,929 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 34 [2022-02-21 03:32:54,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 03:32:54,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 03:32:54,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} is VALID [2022-02-21 03:32:54,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1877#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#(or (< |ULTIMATE.start_sort_#t~mem5#1| |ULTIMATE.start_sort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 03:32:54,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1902#(or (< |ULTIMATE.start_sort_#t~mem5#1| |ULTIMATE.start_sort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1777#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1777#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 03:32:54,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 03:32:54,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1777#true} is VALID [2022-02-21 03:32:54,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1); {1777#true} is VALID [2022-02-21 03:32:54,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; {1777#true} is VALID [2022-02-21 03:32:54,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 03:32:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:32:54,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768815545] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:54,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:54,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 21 [2022-02-21 03:32:54,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982753041] [2022-02-21 03:32:54,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:54,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 03:32:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:32:54,128 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:54,679 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:32:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:32:54,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:54,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 03:32:54,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:32:54,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-02-21 03:32:54,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:32:54,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 03:32:54,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-02-21 03:32:54,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:54,740 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-02-21 03:32:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-02-21 03:32:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 03:32:54,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:54,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,742 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,742 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,743 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:54,744 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-02-21 03:32:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-02-21 03:32:54,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 45 states and 58 transitions. [2022-02-21 03:32:54,744 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 45 states and 58 transitions. [2022-02-21 03:32:54,744 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:54,745 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-02-21 03:32:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-02-21 03:32:54,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:54,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-21 03:32:54,746 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:32:54,746 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:32:54,746 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:32:54,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:32:54,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:54,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:54,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:54,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:54,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:54,748 INFO L791 eck$LassoCheckResult]: Stem: 2006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2007#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 2012#L558 assume !(main_~array_size~0#1 < 1); 2013#L558-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;main_~i~1#1 := 0; 2020#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2021#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2022#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2023#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2031#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2030#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2029#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2004#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2005#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2016#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2035#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2010#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2011#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2015#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2025#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2034#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2027#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2028#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2009#L551-3 [2022-02-21 03:32:54,748 INFO L793 eck$LassoCheckResult]: Loop: 2009#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2014#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2008#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2009#L551-3 [2022-02-21 03:32:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2022-02-21 03:32:54,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127982819] [2022-02-21 03:32:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2022-02-21 03:32:54,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219378374] [2022-02-21 03:32:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,840 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2022-02-21 03:32:54,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427186003] [2022-02-21 03:32:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,927 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:56,049 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:56,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:56,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:56,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:56,049 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:56,049 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:56,049 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:56,049 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:56,049 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration10_Lasso [2022-02-21 03:32:56,049 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:56,049 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:56,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:56,725 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:32:56,738 INFO L158 Benchmark]: Toolchain (without parser) took 12307.56ms. Allocated memory was 119.5MB in the beginning and 222.3MB in the end (delta: 102.8MB). Free memory was 84.5MB in the beginning and 135.4MB in the end (delta: -50.9MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,738 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:56,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.09ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 86.6MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,740 INFO L158 Benchmark]: Boogie Preprocessor took 23.06ms. Allocated memory is still 119.5MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,741 INFO L158 Benchmark]: RCFGBuilder took 359.84ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,741 INFO L158 Benchmark]: BuchiAutomizer took 11516.73ms. Allocated memory was 119.5MB in the beginning and 222.3MB in the end (delta: 102.8MB). Free memory was 69.8MB in the beginning and 135.4MB in the end (delta: -65.6MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:56,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.09ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 86.6MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.06ms. Allocated memory is still 119.5MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.84ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 11516.73ms. Allocated memory was 119.5MB in the beginning and 222.3MB in the end (delta: 102.8MB). Free memory was 69.8MB in the beginning and 135.4MB in the end (delta: -65.6MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:32:56,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:56,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:57,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:57,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 03:32:57,579 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: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula!