./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.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_Nested-alloca.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 e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:49,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:49,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:50,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:50,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:50,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:50,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:50,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:50,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:50,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:50,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:50,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:50,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:50,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:50,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:50,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:50,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:50,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:50,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:50,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:50,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:50,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:50,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:50,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:50,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:50,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:50,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:50,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:50,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:50,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:50,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:50,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:50,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:50,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:50,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:50,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:50,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:50,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:50,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:50,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:50,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:50,085 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:50,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:50,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:50,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:50,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:50,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:50,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:50,123 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:50,123 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:50,123 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:50,123 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:50,124 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:50,124 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:50,124 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:50,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:50,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:50,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:50,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:50,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:50,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:50,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:50,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:50,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:50,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:50,128 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:50,128 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 -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2022-02-21 03:32:50,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:50,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:50,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:50,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:50,405 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:50,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-02-21 03:32:50,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06e81f87/787f14facf444bbd893ca7c8c6ae606a/FLAG42c4eef25 [2022-02-21 03:32:50,974 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:50,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-02-21 03:32:50,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06e81f87/787f14facf444bbd893ca7c8c6ae606a/FLAG42c4eef25 [2022-02-21 03:32:51,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06e81f87/787f14facf444bbd893ca7c8c6ae606a [2022-02-21 03:32:51,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:51,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:51,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:51,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:51,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:51,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b40b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51, skipping insertion in model container [2022-02-21 03:32:51,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:51,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:51,585 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:51,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:51,669 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:51,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51 WrapperNode [2022-02-21 03:32:51,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:51,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:51,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:51,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:51,679 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:51" (1/1) ... [2022-02-21 03:32:51,694 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:51" (1/1) ... [2022-02-21 03:32:51,711 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-02-21 03:32:51,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:51,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:51,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:51,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:51,719 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:51" (1/1) ... [2022-02-21 03:32:51,719 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:51" (1/1) ... [2022-02-21 03:32:51,722 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:51" (1/1) ... [2022-02-21 03:32:51,723 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:51" (1/1) ... [2022-02-21 03:32:51,734 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:51" (1/1) ... [2022-02-21 03:32:51,742 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:51" (1/1) ... [2022-02-21 03:32:51,745 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:51" (1/1) ... [2022-02-21 03:32:51,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:51,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:51,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:51,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:51,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,791 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:51,820 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:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:51,942 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:51,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:52,159 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:52,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:52,165 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:52,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:52 BoogieIcfgContainer [2022-02-21 03:32:52,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:52,180 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:52,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:52,184 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:52,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:51" (1/3) ... [2022-02-21 03:32:52,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@453a4385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:52, skipping insertion in model container [2022-02-21 03:32:52,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (2/3) ... [2022-02-21 03:32:52,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@453a4385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:52, skipping insertion in model container [2022-02-21 03:32:52,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:52" (3/3) ... [2022-02-21 03:32:52,188 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-02-21 03:32:52,236 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:52,237 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:52,237 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:52,237 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:52,237 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:52,237 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:52,237 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:52,238 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:52,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 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,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:52,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,288 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:52,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:52,288 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:52,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 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,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:52,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,295 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:52,295 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:52,300 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 6#L552-4true [2022-02-21 03:32:52,301 INFO L793 eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 12#L553-4true assume !true; 5#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 6#L552-4true [2022-02-21 03:32:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:52,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073818756] [2022-02-21 03:32:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,520 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-02-21 03:32:52,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967479223] [2022-02-21 03:32:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:52,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {18#true} is VALID [2022-02-21 03:32:52,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {18#true} is VALID [2022-02-21 03:32:52,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {18#true} assume !true; {19#false} is VALID [2022-02-21 03:32:52,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {19#false} is VALID [2022-02-21 03:32:52,608 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:52,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:52,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967479223] [2022-02-21 03:32:52,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967479223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:52,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:52,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:52,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365352086] [2022-02-21 03:32:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:52,616 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:52,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:32:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:32:52,646 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:52,698 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:32:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:32:52,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:52,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-02-21 03:32:52,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:52,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-02-21 03:32:52,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:52,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:32:52,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-02-21 03:32:52,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:52,721 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:32:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-02-21 03:32:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:32:52,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:52,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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,742 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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,743 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:52,745 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:32:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:32:52,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 8 states and 9 transitions. [2022-02-21 03:32:52,749 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 8 states and 9 transitions. [2022-02-21 03:32:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:52,751 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:32:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:32:52,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:52,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-02-21 03:32:52,754 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:32:52,754 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:32:52,754 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:52,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:32:52,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:52,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:52,759 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:52,759 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2022-02-21 03:32:52,761 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2022-02-21 03:32:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:32:52,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80008741] [2022-02-21 03:32:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,838 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-02-21 03:32:52,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325213439] [2022-02-21 03:32:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:52,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {61#true} is VALID [2022-02-21 03:32:52,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {63#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:52,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {64#(<= |ULTIMATE.start_main_#t~mem9#1| 3)} is VALID [2022-02-21 03:32:52,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {64#(<= |ULTIMATE.start_main_#t~mem9#1| 3)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {62#false} is VALID [2022-02-21 03:32:52,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {62#false} is VALID [2022-02-21 03:32:52,922 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:52,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:52,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325213439] [2022-02-21 03:32:52,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325213439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:52,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:52,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:52,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701519939] [2022-02-21 03:32:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:52,924 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:52,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:32:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:32:52,925 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:53,009 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:32:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:32:53,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:53,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-02-21 03:32:53,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:32:53,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-02-21 03:32:53,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:53,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:53,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-02-21 03:32:53,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:53,027 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-21 03:32:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-02-21 03:32:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:32:53,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:53,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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,029 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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,029 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:53,031 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:32:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:32:53,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:53,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:53,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 states and 12 transitions. [2022-02-21 03:32:53,032 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 states and 12 transitions. [2022-02-21 03:32:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:53,033 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:32:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:32:53,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:53,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:53,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:53,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-21 03:32:53,034 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:32:53,034 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:32:53,034 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:53,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:32:53,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:53,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:53,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:53,035 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:53,035 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:53,036 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 81#L552-4 [2022-02-21 03:32:53,036 INFO L793 eck$LassoCheckResult]: Loop: 81#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 82#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 86#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 85#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 83#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 84#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 87#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 80#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 81#L552-4 [2022-02-21 03:32:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:32:53,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254427032] [2022-02-21 03:32:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,075 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-02-21 03:32:53,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792879582] [2022-02-21 03:32:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {115#true} is VALID [2022-02-21 03:32:53,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {117#(= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {118#(and (= 0 (+ (* (- 1) |ULTIMATE.start_main_#t~mem9#1|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) (= (+ |ULTIMATE.start_main_#t~mem9#1| (- 3)) 0))} is VALID [2022-02-21 03:32:53,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(and (= 0 (+ (* (- 1) |ULTIMATE.start_main_#t~mem9#1|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) (= (+ |ULTIMATE.start_main_#t~mem9#1| (- 3)) 0))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:53,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {120#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} is VALID [2022-02-21 03:32:53,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {121#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} is VALID [2022-02-21 03:32:53,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {121#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {116#false} is VALID [2022-02-21 03:32:53,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {116#false} is VALID [2022-02-21 03:32:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:53,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:53,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792879582] [2022-02-21 03:32:53,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792879582] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:53,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672946142] [2022-02-21 03:32:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:53,260 INFO L229 MonitoredProcess]: Starting monitored process 2 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,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:32:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:53,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:32:53,661 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-02-21 03:32:53,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-02-21 03:32:53,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:53,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:32:53,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {115#true} is VALID [2022-02-21 03:32:53,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {138#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5)} is VALID [2022-02-21 03:32:53,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {142#(<= |ULTIMATE.start_main_#t~mem9#1| 5)} is VALID [2022-02-21 03:32:53,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {142#(<= |ULTIMATE.start_main_#t~mem9#1| 5)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {116#false} is VALID [2022-02-21 03:32:53,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {116#false} is VALID [2022-02-21 03:32:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:53,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:54,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {116#false} is VALID [2022-02-21 03:32:54,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {121#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {116#false} is VALID [2022-02-21 03:32:54,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {121#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} is VALID [2022-02-21 03:32:54,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {120#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} is VALID [2022-02-21 03:32:54,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {119#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {115#true} is VALID [2022-02-21 03:32:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:54,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672946142] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:54,199 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:54,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-02-21 03:32:54,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680022641] [2022-02-21 03:32:54,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:54,201 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:54,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:32:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:32:54,203 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:54,334 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 03:32:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:32:54,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:54,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-02-21 03:32:54,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-02-21 03:32:54,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-02-21 03:32:54,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:32:54,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:32:54,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-02-21 03:32:54,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:54,362 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-21 03:32:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-02-21 03:32:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:32:54,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:54,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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,364 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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,364 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:54,368 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 03:32:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 03:32:54,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 states and 21 transitions. [2022-02-21 03:32:54,370 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 states and 21 transitions. [2022-02-21 03:32:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:54,371 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 03:32:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 03:32:54,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:54,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-21 03:32:54,372 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-21 03:32:54,373 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-21 03:32:54,373 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:54,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-02-21 03:32:54,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-02-21 03:32:54,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:54,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:54,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:54,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:32:54,377 INFO L791 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 196#L552-4 [2022-02-21 03:32:54,377 INFO L793 eck$LassoCheckResult]: Loop: 196#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 197#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 202#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 211#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 198#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 199#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 200#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 201#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 210#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 209#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 208#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 207#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 206#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 204#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 205#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 203#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 195#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 196#L552-4 [2022-02-21 03:32:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:32:54,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401463011] [2022-02-21 03:32:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,421 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,431 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-02-21 03:32:54,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163216463] [2022-02-21 03:32:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {257#true} is VALID [2022-02-21 03:32:55,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:55,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {260#(and (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (<= |ULTIMATE.start_main_#t~mem9#1| 3))} is VALID [2022-02-21 03:32:55,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#(and (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (<= |ULTIMATE.start_main_#t~mem9#1| 3))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {261#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} is VALID [2022-02-21 03:32:55,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:55,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {263#(and (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (or (<= |ULTIMATE.start_main_#t~mem9#1| 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= |ULTIMATE.start_main_#t~mem9#1| 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} is VALID [2022-02-21 03:32:55,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(and (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (or (<= |ULTIMATE.start_main_#t~mem9#1| 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= |ULTIMATE.start_main_#t~mem9#1| 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {264#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} is VALID [2022-02-21 03:32:55,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:55,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {266#(and (or (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (= 0 (+ (* (- 1) |ULTIMATE.start_main_#t~mem9#1|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem9#1| 7))} is VALID [2022-02-21 03:32:55,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(and (or (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= |ULTIMATE.start_main_#t~mem9#1| 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (= 0 (+ (* (- 1) |ULTIMATE.start_main_#t~mem9#1|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem9#1| 7))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {267#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:55,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} is VALID [2022-02-21 03:32:55,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {269#(and (or (<= |ULTIMATE.start_main_#t~mem9#1| 6) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem9#1| 9) (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= |ULTIMATE.start_main_#t~mem9#1| 6)))} is VALID [2022-02-21 03:32:55,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {269#(and (or (<= |ULTIMATE.start_main_#t~mem9#1| 6) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem9#1| 9) (= (+ |ULTIMATE.start_main_#t~mem9#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|))) 0) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= |ULTIMATE.start_main_#t~mem9#1| 6)))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {270#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:55,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {271#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} is VALID [2022-02-21 03:32:55,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {271#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {272#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} is VALID [2022-02-21 03:32:55,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {258#false} is VALID [2022-02-21 03:32:55,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {258#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {258#false} is VALID [2022-02-21 03:32:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:55,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:55,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163216463] [2022-02-21 03:32:55,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163216463] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:55,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901373292] [2022-02-21 03:32:55,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:32:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:55,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:55,045 INFO L229 MonitoredProcess]: Starting monitored process 3 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:55,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:32:55,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:32:55,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:32:55,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:32:55,342 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-02-21 03:32:55,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-02-21 03:32:55,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-02-21 03:32:55,865 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-02-21 03:32:55,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-02-21 03:32:56,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-02-21 03:32:56,388 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-02-21 03:32:56,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-02-21 03:32:56,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-02-21 03:32:56,985 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-02-21 03:32:56,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-02-21 03:32:57,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:57,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:32:57,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#true} call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {257#true} is VALID [2022-02-21 03:32:57,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:57,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} is VALID [2022-02-21 03:32:57,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {259#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3)} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {261#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} is VALID [2022-02-21 03:32:57,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 2) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:57,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:57,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {264#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} is VALID [2022-02-21 03:32:57,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 3) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:57,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:57,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 5) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {267#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} is VALID [2022-02-21 03:32:57,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 7) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 4) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} is VALID [2022-02-21 03:32:57,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} is VALID [2022-02-21 03:32:57,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(and (or (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~c~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9) (or (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 6)))} assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; {270#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} is VALID [2022-02-21 03:32:57,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 9)} call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; {271#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} is VALID [2022-02-21 03:32:57,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {271#(<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 11)} call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {272#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} is VALID [2022-02-21 03:32:57,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#(<= |ULTIMATE.start_main_#t~mem9#1| 11)} assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; {258#false} is VALID [2022-02-21 03:32:57,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {258#false} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {258#false} is VALID [2022-02-21 03:32:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:57,303 INFO L328 TraceCheckSpWp]: Computing backward predicates...