./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:24:12,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:24:12,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:24:12,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:24:12,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:24:12,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:24:12,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:24:12,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:24:12,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:24:12,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:24:12,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:24:12,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:24:12,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:24:12,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:24:12,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:24:12,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:24:12,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:24:12,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:24:12,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:24:12,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:24:12,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:24:12,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:24:12,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:24:12,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:24:12,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:24:12,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:24:12,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:24:12,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:24:12,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:24:12,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:24:12,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:24:12,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:24:12,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:24:12,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:24:12,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:24:12,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:24:12,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:24:12,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:24:12,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:24:12,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:24:12,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:24:12,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:24:12,142 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:24:12,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:24:12,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:24:12,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:24:12,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:24:12,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:24:12,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:24:12,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:24:12,145 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:24:12,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:24:12,146 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:24:12,147 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:24:12,148 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:24:12,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:24:12,148 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:24:12,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:24:12,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:24:12,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:24:12,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:24:12,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:24:12,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:12,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:24:12,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:24:12,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:24:12,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:24:12,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:24:12,150 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:24:12,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:24:12,151 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:24:12,151 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-02-17 08:24:12,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:24:12,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:24:12,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:24:12,366 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:24:12,366 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:24:12,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-02-17 08:24:13,345 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:24:13,602 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:24:13,602 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-02-17 08:24:13,610 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e41bc1b2/2f4c99a2d07943c3892b8b2437c6087d/FLAG1bf616979 [2023-02-17 08:24:13,636 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e41bc1b2/2f4c99a2d07943c3892b8b2437c6087d [2023-02-17 08:24:13,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:24:13,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:24:13,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:13,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:24:13,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:24:13,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:13" (1/1) ... [2023-02-17 08:24:13,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bac25a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:13, skipping insertion in model container [2023-02-17 08:24:13,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:13" (1/1) ... [2023-02-17 08:24:13,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:24:13,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:13,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:13,956 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 08:24:13,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@46f2e2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:13, skipping insertion in model container [2023-02-17 08:24:13,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:13,957 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:24:13,958 INFO L158 Benchmark]: Toolchain (without parser) took 304.45ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 117.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:24:13,959 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:24:13,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.49ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 117.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:24:13,960 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.49ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 117.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:24:15,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:24:15,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:24:15,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:24:15,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:24:15,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:24:15,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:24:15,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:24:15,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:24:15,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:24:15,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:24:15,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:24:15,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:24:15,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:24:15,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:24:15,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:24:15,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:24:15,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:24:15,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:24:15,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:24:15,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:24:15,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:24:15,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:24:15,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:24:15,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:24:15,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:24:15,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:24:15,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:24:15,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:24:15,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:24:15,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:24:15,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:24:15,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:24:15,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:24:15,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:24:15,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:24:15,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:24:15,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:24:15,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:24:15,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:24:15,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:24:15,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:24:15,738 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:24:15,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:24:15,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:24:15,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:24:15,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:24:15,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:24:15,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:24:15,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:24:15,741 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:24:15,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:24:15,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:24:15,743 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:24:15,744 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:24:15,744 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:24:15,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:24:15,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:24:15,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:24:15,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:15,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:24:15,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:24:15,745 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:24:15,745 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:15,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:24:15,745 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:24:15,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:24:15,746 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:24:15,746 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:24:15,746 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-02-17 08:24:15,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:24:16,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:24:16,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:24:16,023 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:24:16,023 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:24:16,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-02-17 08:24:17,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:24:17,237 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:24:17,237 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-02-17 08:24:17,244 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa8c7784/33976a568a54425983a667596b2a3612/FLAG7466ff8f2 [2023-02-17 08:24:17,255 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa8c7784/33976a568a54425983a667596b2a3612 [2023-02-17 08:24:17,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:24:17,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:24:17,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:17,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:24:17,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:24:17,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@966581e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17, skipping insertion in model container [2023-02-17 08:24:17,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:24:17,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:17,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:17,524 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:24:17,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:17,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:17,571 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:24:17,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:17,629 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:24:17,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17 WrapperNode [2023-02-17 08:24:17,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:17,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:17,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:24:17,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:24:17,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,674 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-17 08:24:17,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:17,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:24:17,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:24:17,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:24:17,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:24:17,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:24:17,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:24:17,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:24:17,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (1/1) ... [2023-02-17 08:24:17,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:17,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:17,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 08:24:17,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-17 08:24:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 08:24:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 08:24:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:24:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:24:17,837 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:24:17,838 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:24:18,359 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:24:18,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:24:18,364 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 08:24:18,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:18 BoogieIcfgContainer [2023-02-17 08:24:18,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:24:18,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:24:18,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:24:18,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:24:18,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:24:17" (1/3) ... [2023-02-17 08:24:18,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a761297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:18, skipping insertion in model container [2023-02-17 08:24:18,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:17" (2/3) ... [2023-02-17 08:24:18,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a761297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:18, skipping insertion in model container [2023-02-17 08:24:18,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:18" (3/3) ... [2023-02-17 08:24:18,371 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2023-02-17 08:24:18,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:24:18,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-17 08:24:18,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:24:18,429 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d28128a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:24:18,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-17 08:24:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 08:24:18,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:18,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 08:24:18,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2023-02-17 08:24:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:18,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532870722] [2023-02-17 08:24:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:18,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:18,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 08:24:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:18,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:18,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:18,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:18,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:18,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:24:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:18,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:18,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532870722] [2023-02-17 08:24:18,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532870722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:18,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:18,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242039734] [2023-02-17 08:24:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:18,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:18,596 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2023-02-17 08:24:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:19,007 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2023-02-17 08:24:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:19,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) Word has length 4 [2023-02-17 08:24:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:19,014 INFO L225 Difference]: With dead ends: 208 [2023-02-17 08:24:19,014 INFO L226 Difference]: Without dead ends: 206 [2023-02-17 08:24:19,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:19,017 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:19,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-17 08:24:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2023-02-17 08:24:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2023-02-17 08:24:19,045 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2023-02-17 08:24:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:19,046 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2023-02-17 08:24:19,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2023-02-17 08:24:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2023-02-17 08:24:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 08:24:19,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:19,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 08:24:19,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 08:24:19,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:19,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2023-02-17 08:24:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:19,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660664947] [2023-02-17 08:24:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:19,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:19,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 08:24:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:19,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:24:19,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:19,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:19,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:19,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:24:19,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:19,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:19,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:19,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:19,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660664947] [2023-02-17 08:24:19,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660664947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:19,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:19,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114643504] [2023-02-17 08:24:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:19,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:19,385 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2023-02-17 08:24:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:19,810 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2023-02-17 08:24:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) Word has length 4 [2023-02-17 08:24:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:19,813 INFO L225 Difference]: With dead ends: 196 [2023-02-17 08:24:19,813 INFO L226 Difference]: Without dead ends: 196 [2023-02-17 08:24:19,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:19,814 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:19,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-17 08:24:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2023-02-17 08:24:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2023-02-17 08:24:19,832 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2023-02-17 08:24:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:19,832 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2023-02-17 08:24:19,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2023-02-17 08:24:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2023-02-17 08:24:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:24:19,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:19,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:24:19,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:20,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2023-02-17 08:24:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:20,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69316296] [2023-02-17 08:24:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:20,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:20,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:20,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:20,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 08:24:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:20,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:24:20,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:20,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:20,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:20,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69316296] [2023-02-17 08:24:20,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69316296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:20,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:20,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504821081] [2023-02-17 08:24:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:20,100 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2023-02-17 08:24:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:20,284 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2023-02-17 08:24:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:20,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) Word has length 5 [2023-02-17 08:24:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:20,286 INFO L225 Difference]: With dead ends: 208 [2023-02-17 08:24:20,286 INFO L226 Difference]: Without dead ends: 208 [2023-02-17 08:24:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:20,287 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:20,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-17 08:24:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2023-02-17 08:24:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2023-02-17 08:24:20,294 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2023-02-17 08:24:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:20,295 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2023-02-17 08:24:20,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2023-02-17 08:24:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2023-02-17 08:24:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:24:20,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:20,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:24:20,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:20,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:20,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2023-02-17 08:24:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327993395] [2023-02-17 08:24:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:20,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:20,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 08:24:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:20,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:20,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:20,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:20,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:20,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:20,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327993395] [2023-02-17 08:24:20,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327993395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:20,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:20,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415295853] [2023-02-17 08:24:20,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:20,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:20,596 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2023-02-17 08:24:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:20,839 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2023-02-17 08:24:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) Word has length 5 [2023-02-17 08:24:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:20,840 INFO L225 Difference]: With dead ends: 181 [2023-02-17 08:24:20,840 INFO L226 Difference]: Without dead ends: 181 [2023-02-17 08:24:20,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:20,841 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:20,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-17 08:24:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-02-17 08:24:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-17 08:24:20,847 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2023-02-17 08:24:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:20,847 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-17 08:24:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2023-02-17 08:24:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-17 08:24:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:24:20,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:20,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:20,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:21,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2023-02-17 08:24:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398135707] [2023-02-17 08:24:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:21,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:21,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 08:24:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:21,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:24:21,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:21,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-17 08:24:21,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:21,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:21,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 08:24:21,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 08:24:21,201 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:24:21,203 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:24:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:21,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:21,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:21,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398135707] [2023-02-17 08:24:21,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398135707] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:21,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:21,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:24:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222436435] [2023-02-17 08:24:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:21,211 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:21,554 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2023-02-17 08:24:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 08:24:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:21,555 INFO L225 Difference]: With dead ends: 183 [2023-02-17 08:24:21,555 INFO L226 Difference]: Without dead ends: 183 [2023-02-17 08:24:21,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:21,556 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:21,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 602 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-17 08:24:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2023-02-17 08:24:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-17 08:24:21,562 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2023-02-17 08:24:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:21,563 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-17 08:24:21,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-17 08:24:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:24:21,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:21,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:21,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-17 08:24:21,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2023-02-17 08:24:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:21,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141682198] [2023-02-17 08:24:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:21,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:21,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 08:24:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:21,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:24:21,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:21,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:21,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:21,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141682198] [2023-02-17 08:24:21,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141682198] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:21,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:21,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:21,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320485207] [2023-02-17 08:24:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:21,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:21,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:21,897 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:21,917 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2023-02-17 08:24:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:24:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:21,922 INFO L225 Difference]: With dead ends: 258 [2023-02-17 08:24:21,922 INFO L226 Difference]: Without dead ends: 258 [2023-02-17 08:24:21,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:21,924 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:21,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 545 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-17 08:24:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2023-02-17 08:24:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2023-02-17 08:24:21,935 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2023-02-17 08:24:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:21,935 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2023-02-17 08:24:21,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2023-02-17 08:24:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:24:21,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:21,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:21,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:22,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2023-02-17 08:24:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:22,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336200210] [2023-02-17 08:24:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:22,147 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:22,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 08:24:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:22,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:22,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:22,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:22,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:22,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:22,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336200210] [2023-02-17 08:24:22,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336200210] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:22,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:22,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183518623] [2023-02-17 08:24:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:22,213 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:22,417 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2023-02-17 08:24:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:24:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:22,419 INFO L225 Difference]: With dead ends: 209 [2023-02-17 08:24:22,419 INFO L226 Difference]: Without dead ends: 209 [2023-02-17 08:24:22,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:22,420 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:22,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-17 08:24:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2023-02-17 08:24:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2023-02-17 08:24:22,424 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2023-02-17 08:24:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:22,424 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2023-02-17 08:24:22,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2023-02-17 08:24:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:24:22,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:22,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:22,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:22,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2023-02-17 08:24:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:22,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371830939] [2023-02-17 08:24:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:22,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:22,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 08:24:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:22,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:22,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:22,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:22,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-17 08:24:22,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-02-17 08:24:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:22,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:22,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:22,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371830939] [2023-02-17 08:24:22,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371830939] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:22,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:22,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979744457] [2023-02-17 08:24:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:22,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:22,714 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:22,954 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2023-02-17 08:24:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:24:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:22,955 INFO L225 Difference]: With dead ends: 194 [2023-02-17 08:24:22,955 INFO L226 Difference]: Without dead ends: 194 [2023-02-17 08:24:22,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:22,956 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:22,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-17 08:24:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2023-02-17 08:24:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2023-02-17 08:24:22,959 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2023-02-17 08:24:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:22,959 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2023-02-17 08:24:22,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2023-02-17 08:24:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:24:22,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:22,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:22,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-17 08:24:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2023-02-17 08:24:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:23,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953172002] [2023-02-17 08:24:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:23,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:23,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:23,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 08:24:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:23,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:23,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:23,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:23,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:23,255 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-17 08:24:23,264 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-17 08:24:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:23,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:23,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953172002] [2023-02-17 08:24:23,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953172002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:23,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:23,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:23,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900319105] [2023-02-17 08:24:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:23,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:23,270 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:23,649 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2023-02-17 08:24:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:24:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:23,651 INFO L225 Difference]: With dead ends: 243 [2023-02-17 08:24:23,651 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 08:24:23,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:24:23,651 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 26 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:23,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 387 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 08:24:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2023-02-17 08:24:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2023-02-17 08:24:23,655 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2023-02-17 08:24:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:23,656 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2023-02-17 08:24:23,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2023-02-17 08:24:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:24:23,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:23,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:23,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:23,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2023-02-17 08:24:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:23,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063244648] [2023-02-17 08:24:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:23,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:23,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 08:24:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:23,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:24:23,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:23,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:23,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:23,943 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-17 08:24:23,946 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-17 08:24:23,963 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-17 08:24:23,967 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-17 08:24:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:23,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:23,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063244648] [2023-02-17 08:24:23,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063244648] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060302450] [2023-02-17 08:24:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:23,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:23,976 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:24,469 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2023-02-17 08:24:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:24:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:24,471 INFO L225 Difference]: With dead ends: 200 [2023-02-17 08:24:24,471 INFO L226 Difference]: Without dead ends: 200 [2023-02-17 08:24:24,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:24,471 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:24,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 485 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:24:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-17 08:24:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2023-02-17 08:24:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2023-02-17 08:24:24,475 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2023-02-17 08:24:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:24,475 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2023-02-17 08:24:24,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2023-02-17 08:24:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:24:24,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:24,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:24,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2023-02-17 08:24:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:24,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962582505] [2023-02-17 08:24:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:24,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:24,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 08:24:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:24,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:24:24,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:24,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:24,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 32 [2023-02-17 08:24:24,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:24,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:24,802 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 76 [2023-02-17 08:24:24,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 44 [2023-02-17 08:24:24,815 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 32 [2023-02-17 08:24:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:24:24,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:26,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))))) is different from false [2023-02-17 08:24:26,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:26,874 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-17 08:24:26,876 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 28 [2023-02-17 08:24:26,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-02-17 08:24:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:24:26,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962582505] [2023-02-17 08:24:26,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962582505] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:26,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:26,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-17 08:24:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378962539] [2023-02-17 08:24:26,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:26,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:24:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:24:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2023-02-17 08:24:26,893 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:27,903 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2023-02-17 08:24:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 08:24:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:27,904 INFO L225 Difference]: With dead ends: 203 [2023-02-17 08:24:27,904 INFO L226 Difference]: Without dead ends: 203 [2023-02-17 08:24:27,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=33, Invalid=78, Unknown=3, NotChecked=18, Total=132 [2023-02-17 08:24:27,905 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 23 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:27,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 816 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 579 Invalid, 0 Unknown, 92 Unchecked, 1.0s Time] [2023-02-17 08:24:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-17 08:24:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2023-02-17 08:24:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2023-02-17 08:24:27,908 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2023-02-17 08:24:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:27,908 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2023-02-17 08:24:27,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2023-02-17 08:24:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:24:27,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:27,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:27,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:28,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:28,110 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2023-02-17 08:24:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:28,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218408084] [2023-02-17 08:24:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:28,111 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 08:24:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:28,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 08:24:28,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:28,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:28,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-02-17 08:24:28,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:28,235 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-17 08:24:28,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,267 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:28,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:28,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 35 [2023-02-17 08:24:28,305 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 23 [2023-02-17 08:24:28,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 08:24:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:28,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:28,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse1)))))) is different from false [2023-02-17 08:24:28,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2023-02-17 08:24:28,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (_ bv0 32))))) (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) .cse2)))))) is different from false [2023-02-17 08:24:28,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,507 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-17 08:24:28,508 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 36 [2023-02-17 08:24:28,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,512 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2023-02-17 08:24:28,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,516 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-02-17 08:24:28,521 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 62 [2023-02-17 08:24:28,524 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 102 [2023-02-17 08:24:28,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 52 treesize of output 44 [2023-02-17 08:24:28,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 82 [2023-02-17 08:24:28,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,553 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-02-17 08:24:28,558 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 56 [2023-02-17 08:24:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-17 08:24:28,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:28,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218408084] [2023-02-17 08:24:28,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218408084] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:28,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:28,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 08:24:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604189498] [2023-02-17 08:24:28,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:28,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 08:24:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 08:24:28,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-17 08:24:28,745 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:30,779 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2023-02-17 08:24:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:24:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 08:24:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:30,781 INFO L225 Difference]: With dead ends: 209 [2023-02-17 08:24:30,781 INFO L226 Difference]: Without dead ends: 209 [2023-02-17 08:24:30,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=179, Unknown=3, NotChecked=90, Total=342 [2023-02-17 08:24:30,782 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:30,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 968 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 245 Unchecked, 1.9s Time] [2023-02-17 08:24:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-17 08:24:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2023-02-17 08:24:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2023-02-17 08:24:30,785 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2023-02-17 08:24:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:30,785 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2023-02-17 08:24:30,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2023-02-17 08:24:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:24:30,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:30,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:30,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:30,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:30,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2023-02-17 08:24:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:30,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459972618] [2023-02-17 08:24:30,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:24:30,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:30,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:30,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:30,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 08:24:31,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:24:31,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:24:31,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 08:24:31,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:31,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:31,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-02-17 08:24:31,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:31,180 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-17 08:24:31,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,218 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:31,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:31,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 35 [2023-02-17 08:24:31,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,268 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:31,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:31,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 35 [2023-02-17 08:24:31,311 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 23 [2023-02-17 08:24:31,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 08:24:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:31,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:31,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0) .cse1))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))) is different from false [2023-02-17 08:24:31,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-02-17 08:24:31,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2)) (.cse3 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0))))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) .cse3)))))) is different from false [2023-02-17 08:24:31,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0))))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))))) is different from false [2023-02-17 08:24:31,568 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0))))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2023-02-17 08:24:31,606 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) (_ bv0 32))))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse1))))))))) is different from false [2023-02-17 08:24:31,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,618 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 98 [2023-02-17 08:24:31,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,623 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 68 [2023-02-17 08:24:31,627 INFO L350 Elim1Store]: Elim1 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 464 treesize of output 398 [2023-02-17 08:24:31,636 INFO L350 Elim1Store]: Elim1 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 880 treesize of output 826 [2023-02-17 08:24:31,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 822 treesize of output 774 [2023-02-17 08:24:31,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 774 treesize of output 670 [2023-02-17 08:24:31,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 670 treesize of output 622 [2023-02-17 08:24:31,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 622 treesize of output 606