./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/uthash-2.0.2/uthash_SAX_test7-2.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 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:21:06,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:21:06,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:21:06,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:21:06,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:21:06,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:21:06,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:21:06,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:21:06,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:21:06,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:21:06,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:21:06,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:21:06,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:21:06,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:21:06,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:21:06,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:21:07,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:21:07,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:21:07,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:21:07,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:21:07,009 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:21:07,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:21:07,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:21:07,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:21:07,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:21:07,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:21:07,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:21:07,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:21:07,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:21:07,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:21:07,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:21:07,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:21:07,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:21:07,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:21:07,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:21:07,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:21:07,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:21:07,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:21:07,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:21:07,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:21:07,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:21:07,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:21:07,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 13:21:07,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:21:07,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:21:07,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:21:07,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:21:07,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:21:07,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:21:07,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:21:07,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:21:07,050 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:21:07,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:21:07,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:21:07,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:21:07,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:21:07,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:21:07,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:21:07,052 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:21:07,052 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:21:07,052 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:21:07,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:21:07,053 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:21:07,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:21:07,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:21:07,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:21:07,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:21:07,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:21:07,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:21:07,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:21:07,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:21:07,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 13:21:07,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 13:21:07,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2022-07-20 13:21:07,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:21:07,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:21:07,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:21:07,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:21:07,297 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:21:07,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2022-07-20 13:21:07,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd645eb/41a19cd31dd44aa69d327a9f9b31b47d/FLAG59f979514 [2022-07-20 13:21:07,770 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:21:07,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2022-07-20 13:21:07,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd645eb/41a19cd31dd44aa69d327a9f9b31b47d/FLAG59f979514 [2022-07-20 13:21:08,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd645eb/41a19cd31dd44aa69d327a9f9b31b47d [2022-07-20 13:21:08,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:21:08,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:21:08,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:21:08,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:21:08,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:21:08,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:08" (1/1) ... [2022-07-20 13:21:08,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f584cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:08, skipping insertion in model container [2022-07-20 13:21:08,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:08" (1/1) ... [2022-07-20 13:21:08,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:21:08,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:21:08,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[33021,33034] [2022-07-20 13:21:08,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44124,44137] [2022-07-20 13:21:08,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44245,44258] [2022-07-20 13:21:08,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:21:08,653 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) [2022-07-20 13:21:08,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b857094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:08, skipping insertion in model container [2022-07-20 13:21:08,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:21:08,654 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 13:21:08,656 INFO L158 Benchmark]: Toolchain (without parser) took 530.56ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 81.1MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 13:21:08,657 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 13:21:08,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.43ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 81.1MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 13:21:08,659 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.14ms. Allocated memory is still 117.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.43ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 81.1MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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/uthash-2.0.2/uthash_SAX_test7-2.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 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:21:10,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:21:10,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:21:10,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:21:10,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:21:10,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:21:10,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:21:10,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:21:10,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:21:10,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:21:10,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:21:10,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:21:10,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:21:10,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:21:10,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:21:10,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:21:10,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:21:10,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:21:10,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:21:10,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:21:10,202 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:21:10,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:21:10,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:21:10,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:21:10,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:21:10,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:21:10,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:21:10,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:21:10,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:21:10,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:21:10,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:21:10,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:21:10,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:21:10,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:21:10,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:21:10,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:21:10,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:21:10,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:21:10,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:21:10,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:21:10,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:21:10,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:21:10,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 13:21:10,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:21:10,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:21:10,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:21:10,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:21:10,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:21:10,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:21:10,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:21:10,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:21:10,266 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:21:10,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:21:10,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:21:10,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:21:10,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:21:10,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:21:10,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 13:21:10,268 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 13:21:10,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:21:10,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:21:10,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:21:10,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:21:10,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:21:10,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:21:10,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:21:10,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:21:10,270 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 13:21:10,270 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 13:21:10,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 13:21:10,271 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2022-07-20 13:21:10,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:21:10,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:21:10,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:21:10,582 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:21:10,582 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:21:10,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2022-07-20 13:21:10,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69d6bf50/d8534139c2c04cec99c34b17bac55822/FLAG1d0026589 [2022-07-20 13:21:11,077 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:21:11,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2022-07-20 13:21:11,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69d6bf50/d8534139c2c04cec99c34b17bac55822/FLAG1d0026589 [2022-07-20 13:21:11,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69d6bf50/d8534139c2c04cec99c34b17bac55822 [2022-07-20 13:21:11,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:21:11,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:21:11,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:21:11,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:21:11,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:21:11,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:11" (1/1) ... [2022-07-20 13:21:11,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f76777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:11, skipping insertion in model container [2022-07-20 13:21:11,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:11" (1/1) ... [2022-07-20 13:21:11,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:21:11,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:21:11,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[33021,33034] [2022-07-20 13:21:11,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44124,44137] [2022-07-20 13:21:11,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44245,44258] [2022-07-20 13:21:11,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:21:11,962 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 13:21:11,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:21:12,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[33021,33034] [2022-07-20 13:21:12,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44124,44137] [2022-07-20 13:21:12,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44245,44258] [2022-07-20 13:21:12,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:21:12,075 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 13:21:12,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[33021,33034] [2022-07-20 13:21:12,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44124,44137] [2022-07-20 13:21:12,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i[44245,44258] [2022-07-20 13:21:12,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:21:12,189 INFO L208 MainTranslator]: Completed translation [2022-07-20 13:21:12,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12 WrapperNode [2022-07-20 13:21:12,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:21:12,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 13:21:12,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 13:21:12,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 13:21:12,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,319 INFO L137 Inliner]: procedures = 179, calls = 328, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2022-07-20 13:21:12,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 13:21:12,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 13:21:12,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 13:21:12,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 13:21:12,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 13:21:12,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 13:21:12,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 13:21:12,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 13:21:12,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (1/1) ... [2022-07-20 13:21:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:21:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 13:21:12,447 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) [2022-07-20 13:21:12,457 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 [2022-07-20 13:21:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 13:21:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 13:21:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 13:21:12,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 13:21:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 13:21:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 13:21:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 13:21:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 13:21:12,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 13:21:12,704 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 13:21:12,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 13:21:12,722 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 13:21:16,338 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 13:21:16,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 13:21:16,348 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2022-07-20 13:21:16,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:21:16 BoogieIcfgContainer [2022-07-20 13:21:16,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 13:21:16,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 13:21:16,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 13:21:16,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 13:21:16,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:21:11" (1/3) ... [2022-07-20 13:21:16,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a9da33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:21:16, skipping insertion in model container [2022-07-20 13:21:16,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:12" (2/3) ... [2022-07-20 13:21:16,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a9da33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:21:16, skipping insertion in model container [2022-07-20 13:21:16,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:21:16" (3/3) ... [2022-07-20 13:21:16,357 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-2.i [2022-07-20 13:21:16,367 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 13:21:16,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 635 error locations. [2022-07-20 13:21:16,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 13:21:16,412 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bb7b841, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2925b9 [2022-07-20 13:21:16,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 635 error locations. [2022-07-20 13:21:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 1249 states, 612 states have (on average 2.2663398692810457) internal successors, (1387), 1244 states have internal predecessors, (1387), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 13:21:16,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:16,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 13:21:16,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:16,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-07-20 13:21:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:16,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938975923] [2022-07-20 13:21:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:16,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 13:21:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:16,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:16,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:16,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:16,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:16,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:16,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938975923] [2022-07-20 13:21:16,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938975923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:16,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:16,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:21:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700226486] [2022-07-20 13:21:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:16,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:16,689 INFO L87 Difference]: Start difference. First operand has 1249 states, 612 states have (on average 2.2663398692810457) internal successors, (1387), 1244 states have internal predecessors, (1387), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:18,460 INFO L93 Difference]: Finished difference Result 1417 states and 1492 transitions. [2022-07-20 13:21:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 13:21:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:18,493 INFO L225 Difference]: With dead ends: 1417 [2022-07-20 13:21:18,496 INFO L226 Difference]: Without dead ends: 1415 [2022-07-20 13:21:18,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:18,502 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 1160 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:18,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 893 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-20 13:21:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-07-20 13:21:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1230. [2022-07-20 13:21:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 610 states have (on average 2.1163934426229507) internal successors, (1291), 1225 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1297 transitions. [2022-07-20 13:21:18,570 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1297 transitions. Word has length 3 [2022-07-20 13:21:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:18,570 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1297 transitions. [2022-07-20 13:21:18,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1297 transitions. [2022-07-20 13:21:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 13:21:18,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:18,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 13:21:18,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:18,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-07-20 13:21:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:18,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128097400] [2022-07-20 13:21:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:18,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:18,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:18,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 13:21:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:18,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:21:18,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:18,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:18,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:18,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:18,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128097400] [2022-07-20 13:21:18,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128097400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:18,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:18,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:21:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000439409] [2022-07-20 13:21:18,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:18,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:18,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:18,894 INFO L87 Difference]: Start difference. First operand 1230 states and 1297 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:21,532 INFO L93 Difference]: Finished difference Result 1819 states and 1926 transitions. [2022-07-20 13:21:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:21,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 13:21:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:21,538 INFO L225 Difference]: With dead ends: 1819 [2022-07-20 13:21:21,539 INFO L226 Difference]: Without dead ends: 1819 [2022-07-20 13:21:21,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:21,540 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 629 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:21,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1690 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 13:21:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-07-20 13:21:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1431. [2022-07-20 13:21:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 812 states have (on average 2.0985221674876846) internal successors, (1704), 1426 states have internal predecessors, (1704), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1710 transitions. [2022-07-20 13:21:21,567 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1710 transitions. Word has length 3 [2022-07-20 13:21:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:21,568 INFO L495 AbstractCegarLoop]: Abstraction has 1431 states and 1710 transitions. [2022-07-20 13:21:21,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1710 transitions. [2022-07-20 13:21:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 13:21:21,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:21,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:21,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:21,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:21,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-07-20 13:21:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32672032] [2022-07-20 13:21:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:21,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 13:21:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:21,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 13:21:21,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:21,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:21,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:21,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 13:21:21,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:21,958 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:21:21,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 12 [2022-07-20 13:21:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:21,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:21,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32672032] [2022-07-20 13:21:21,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32672032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:21,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:21,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320388816] [2022-07-20 13:21:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:21,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:21,977 INFO L87 Difference]: Start difference. First operand 1431 states and 1710 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:24,495 INFO L93 Difference]: Finished difference Result 1609 states and 1899 transitions. [2022-07-20 13:21:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 13:21:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:24,500 INFO L225 Difference]: With dead ends: 1609 [2022-07-20 13:21:24,500 INFO L226 Difference]: Without dead ends: 1609 [2022-07-20 13:21:24,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:24,507 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 1450 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:24,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 507 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 13:21:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-07-20 13:21:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1219. [2022-07-20 13:21:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 610 states have (on average 2.09672131147541) internal successors, (1279), 1214 states have internal predecessors, (1279), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1285 transitions. [2022-07-20 13:21:24,525 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1285 transitions. Word has length 7 [2022-07-20 13:21:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:24,525 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1285 transitions. [2022-07-20 13:21:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1285 transitions. [2022-07-20 13:21:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 13:21:24,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:24,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:24,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:24,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:24,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-07-20 13:21:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:24,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429974160] [2022-07-20 13:21:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:24,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:24,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:24,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 13:21:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:24,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:24,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:24,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:24,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:24,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429974160] [2022-07-20 13:21:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429974160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:24,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:24,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:21:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688744324] [2022-07-20 13:21:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:24,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:24,870 INFO L87 Difference]: Start difference. First operand 1219 states and 1285 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:26,454 INFO L93 Difference]: Finished difference Result 1548 states and 1643 transitions. [2022-07-20 13:21:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:26,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 13:21:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:26,459 INFO L225 Difference]: With dead ends: 1548 [2022-07-20 13:21:26,459 INFO L226 Difference]: Without dead ends: 1548 [2022-07-20 13:21:26,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:26,460 INFO L413 NwaCegarLoop]: 1133 mSDtfsCounter, 973 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:26,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1476 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-20 13:21:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-20 13:21:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1172. [2022-07-20 13:21:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 610 states have (on average 2.019672131147541) internal successors, (1232), 1167 states have internal predecessors, (1232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1238 transitions. [2022-07-20 13:21:26,476 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1238 transitions. Word has length 8 [2022-07-20 13:21:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:26,477 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1238 transitions. [2022-07-20 13:21:26,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1238 transitions. [2022-07-20 13:21:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 13:21:26,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:26,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:26,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:26,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:26,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-07-20 13:21:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926658405] [2022-07-20 13:21:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:26,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:26,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:26,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 13:21:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:21:26,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:26,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:26,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:26,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:26,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926658405] [2022-07-20 13:21:26,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926658405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:26,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:26,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:21:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897545360] [2022-07-20 13:21:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:26,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:26,809 INFO L87 Difference]: Start difference. First operand 1172 states and 1238 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:28,943 INFO L93 Difference]: Finished difference Result 1627 states and 1725 transitions. [2022-07-20 13:21:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 13:21:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:28,947 INFO L225 Difference]: With dead ends: 1627 [2022-07-20 13:21:28,948 INFO L226 Difference]: Without dead ends: 1627 [2022-07-20 13:21:28,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:28,948 INFO L413 NwaCegarLoop]: 1339 mSDtfsCounter, 674 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1855 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 13:21:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2022-07-20 13:21:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1194. [2022-07-20 13:21:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 642 states have (on average 2.0062305295950154) internal successors, (1288), 1189 states have internal predecessors, (1288), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1294 transitions. [2022-07-20 13:21:28,965 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1294 transitions. Word has length 8 [2022-07-20 13:21:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1294 transitions. [2022-07-20 13:21:28,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1294 transitions. [2022-07-20 13:21:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 13:21:28,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:28,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:28,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:29,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:29,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:29,174 INFO L85 PathProgramCache]: Analyzing trace with hash 871378613, now seen corresponding path program 1 times [2022-07-20 13:21:29,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:29,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635445598] [2022-07-20 13:21:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:29,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:29,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:29,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:29,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 13:21:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:29,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 13:21:29,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:29,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:29,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:29,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635445598] [2022-07-20 13:21:29,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635445598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:29,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:29,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238211102] [2022-07-20 13:21:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:29,331 INFO L87 Difference]: Start difference. First operand 1194 states and 1294 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:29,960 INFO L93 Difference]: Finished difference Result 1841 states and 1984 transitions. [2022-07-20 13:21:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:21:29,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 13:21:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:29,964 INFO L225 Difference]: With dead ends: 1841 [2022-07-20 13:21:29,965 INFO L226 Difference]: Without dead ends: 1841 [2022-07-20 13:21:29,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:29,965 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 754 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:29,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3645 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 13:21:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-07-20 13:21:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1439. [2022-07-20 13:21:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 887 states have (on average 1.9706877113866967) internal successors, (1748), 1434 states have internal predecessors, (1748), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1754 transitions. [2022-07-20 13:21:29,985 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1754 transitions. Word has length 11 [2022-07-20 13:21:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:29,985 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1754 transitions. [2022-07-20 13:21:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1754 transitions. [2022-07-20 13:21:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 13:21:29,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:29,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:29,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:30,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:30,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-07-20 13:21:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359284815] [2022-07-20 13:21:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:30,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:30,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 13:21:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:30,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:21:30,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:30,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:30,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:30,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359284815] [2022-07-20 13:21:30,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359284815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:30,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:30,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979540680] [2022-07-20 13:21:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:30,319 INFO L87 Difference]: Start difference. First operand 1439 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:30,338 INFO L93 Difference]: Finished difference Result 1601 states and 1902 transitions. [2022-07-20 13:21:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-07-20 13:21:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:30,342 INFO L225 Difference]: With dead ends: 1601 [2022-07-20 13:21:30,342 INFO L226 Difference]: Without dead ends: 1601 [2022-07-20 13:21:30,343 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 [2022-07-20 13:21:30,344 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 583 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:30,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1998 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-20 13:21:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1379. [2022-07-20 13:21:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 851 states have (on average 1.9529964747356052) internal successors, (1662), 1374 states have internal predecessors, (1662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1668 transitions. [2022-07-20 13:21:30,362 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1668 transitions. Word has length 13 [2022-07-20 13:21:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:30,363 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 1668 transitions. [2022-07-20 13:21:30,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1668 transitions. [2022-07-20 13:21:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 13:21:30,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:30,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:30,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-20 13:21:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:30,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -459414345, now seen corresponding path program 1 times [2022-07-20 13:21:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:30,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413592524] [2022-07-20 13:21:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:30,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:30,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 13:21:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:30,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:30,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:30,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:30,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:30,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413592524] [2022-07-20 13:21:30,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413592524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:30,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:30,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185467363] [2022-07-20 13:21:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:30,724 INFO L87 Difference]: Start difference. First operand 1379 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:30,774 INFO L93 Difference]: Finished difference Result 1573 states and 1846 transitions. [2022-07-20 13:21:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 13:21:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:30,778 INFO L225 Difference]: With dead ends: 1573 [2022-07-20 13:21:30,778 INFO L226 Difference]: Without dead ends: 1573 [2022-07-20 13:21:30,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:30,778 INFO L413 NwaCegarLoop]: 1137 mSDtfsCounter, 554 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:30,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 3083 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-20 13:21:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1349. [2022-07-20 13:21:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 835 states have (on average 1.9209580838323352) internal successors, (1604), 1344 states have internal predecessors, (1604), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1610 transitions. [2022-07-20 13:21:30,795 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1610 transitions. Word has length 15 [2022-07-20 13:21:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:30,795 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1610 transitions. [2022-07-20 13:21:30,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1610 transitions. [2022-07-20 13:21:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 13:21:30,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:30,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:30,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 13:21:31,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:31,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr634ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2058395604, now seen corresponding path program 1 times [2022-07-20 13:21:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:31,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274072407] [2022-07-20 13:21:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:31,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:31,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:31,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 13:21:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:31,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:21:31,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:31,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 13:21:31,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 13:21:31,176 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-20 13:21:31,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 36 [2022-07-20 13:21:31,205 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-20 13:21:31,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-20 13:21:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:31,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:31,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:31,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274072407] [2022-07-20 13:21:31,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274072407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:31,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:31,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65994965] [2022-07-20 13:21:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:31,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:31,230 INFO L87 Difference]: Start difference. First operand 1349 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:32,158 INFO L93 Difference]: Finished difference Result 1785 states and 2105 transitions. [2022-07-20 13:21:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-07-20 13:21:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:32,162 INFO L225 Difference]: With dead ends: 1785 [2022-07-20 13:21:32,162 INFO L226 Difference]: Without dead ends: 1785 [2022-07-20 13:21:32,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:32,163 INFO L413 NwaCegarLoop]: 1108 mSDtfsCounter, 422 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:32,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3244 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 39 Unchecked, 0.9s Time] [2022-07-20 13:21:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-07-20 13:21:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1348. [2022-07-20 13:21:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 834 states have (on average 1.920863309352518) internal successors, (1602), 1343 states have internal predecessors, (1602), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1608 transitions. [2022-07-20 13:21:32,178 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1608 transitions. Word has length 16 [2022-07-20 13:21:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:32,179 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1608 transitions. [2022-07-20 13:21:32,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1608 transitions. [2022-07-20 13:21:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 13:21:32,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:32,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:32,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-20 13:21:32,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:32,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-07-20 13:21:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:32,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229486874] [2022-07-20 13:21:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:32,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:32,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 13:21:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:32,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:21:32,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:32,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:32,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:32,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229486874] [2022-07-20 13:21:32,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229486874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:32,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:32,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709443154] [2022-07-20 13:21:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:21:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:21:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:32,528 INFO L87 Difference]: Start difference. First operand 1348 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:32,547 INFO L93 Difference]: Finished difference Result 1288 states and 1522 transitions. [2022-07-20 13:21:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:21:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 13:21:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:32,551 INFO L225 Difference]: With dead ends: 1288 [2022-07-20 13:21:32,551 INFO L226 Difference]: Without dead ends: 1288 [2022-07-20 13:21:32,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:21:32,551 INFO L413 NwaCegarLoop]: 1103 mSDtfsCounter, 1087 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:32,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-07-20 13:21:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2022-07-20 13:21:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 798 states have (on average 1.899749373433584) internal successors, (1516), 1283 states have internal predecessors, (1516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1522 transitions. [2022-07-20 13:21:32,564 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1522 transitions. Word has length 18 [2022-07-20 13:21:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:32,565 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1522 transitions. [2022-07-20 13:21:32,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1522 transitions. [2022-07-20 13:21:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 13:21:32,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:32,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:32,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:32,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-07-20 13:21:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459231138] [2022-07-20 13:21:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:32,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:32,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:32,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:32,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 13:21:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:32,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:32,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:32,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:32,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:32,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459231138] [2022-07-20 13:21:32,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459231138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:32,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:32,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:32,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284714304] [2022-07-20 13:21:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:32,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:32,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:32,937 INFO L87 Difference]: Start difference. First operand 1288 states and 1522 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:32,999 INFO L93 Difference]: Finished difference Result 1260 states and 1466 transitions. [2022-07-20 13:21:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 13:21:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:33,004 INFO L225 Difference]: With dead ends: 1260 [2022-07-20 13:21:33,004 INFO L226 Difference]: Without dead ends: 1260 [2022-07-20 13:21:33,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:33,005 INFO L413 NwaCegarLoop]: 1058 mSDtfsCounter, 1058 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:33,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 2131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-07-20 13:21:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1258. [2022-07-20 13:21:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 782 states have (on average 1.8644501278772379) internal successors, (1458), 1253 states have internal predecessors, (1458), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1464 transitions. [2022-07-20 13:21:33,035 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1464 transitions. Word has length 20 [2022-07-20 13:21:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:33,035 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1464 transitions. [2022-07-20 13:21:33,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1464 transitions. [2022-07-20 13:21:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 13:21:33,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:33,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:33,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:33,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:33,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-07-20 13:21:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701580225] [2022-07-20 13:21:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:33,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:33,246 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:33,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 13:21:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:33,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:21:33,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:33,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:33,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:33,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:33,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701580225] [2022-07-20 13:21:33,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701580225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:33,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:33,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683472043] [2022-07-20 13:21:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:33,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:33,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:33,450 INFO L87 Difference]: Start difference. First operand 1258 states and 1464 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:35,362 INFO L93 Difference]: Finished difference Result 1838 states and 2167 transitions. [2022-07-20 13:21:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:21:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-07-20 13:21:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:35,367 INFO L225 Difference]: With dead ends: 1838 [2022-07-20 13:21:35,368 INFO L226 Difference]: Without dead ends: 1838 [2022-07-20 13:21:35,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:35,368 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 1714 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:35,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1217 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 13:21:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-20 13:21:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1254. [2022-07-20 13:21:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 782 states have (on average 1.854219948849105) internal successors, (1450), 1249 states have internal predecessors, (1450), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1456 transitions. [2022-07-20 13:21:35,381 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1456 transitions. Word has length 34 [2022-07-20 13:21:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:35,382 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1456 transitions. [2022-07-20 13:21:35,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1456 transitions. [2022-07-20 13:21:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 13:21:35,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:35,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:35,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 13:21:35,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:35,590 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-07-20 13:21:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:35,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431845130] [2022-07-20 13:21:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:35,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:35,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 13:21:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:35,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 13:21:35,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:35,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:35,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:35,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:35,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431845130] [2022-07-20 13:21:35,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431845130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:35,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:35,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53608370] [2022-07-20 13:21:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:35,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:35,868 INFO L87 Difference]: Start difference. First operand 1254 states and 1456 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:38,756 INFO L93 Difference]: Finished difference Result 1968 states and 2276 transitions. [2022-07-20 13:21:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:21:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-07-20 13:21:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:38,761 INFO L225 Difference]: With dead ends: 1968 [2022-07-20 13:21:38,761 INFO L226 Difference]: Without dead ends: 1968 [2022-07-20 13:21:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:38,762 INFO L413 NwaCegarLoop]: 1381 mSDtfsCounter, 1212 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:38,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2459 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 13:21:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-07-20 13:21:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1250. [2022-07-20 13:21:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 782 states have (on average 1.843989769820972) internal successors, (1442), 1245 states have internal predecessors, (1442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1448 transitions. [2022-07-20 13:21:38,785 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1448 transitions. Word has length 34 [2022-07-20 13:21:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:38,785 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1448 transitions. [2022-07-20 13:21:38,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1448 transitions. [2022-07-20 13:21:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 13:21:38,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:38,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:38,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:38,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:38,995 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-07-20 13:21:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:38,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24467165] [2022-07-20 13:21:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:38,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:38,997 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 13:21:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:39,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:39,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:39,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:39,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:39,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24467165] [2022-07-20 13:21:39,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24467165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:39,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:39,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318387181] [2022-07-20 13:21:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:39,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:39,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:39,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:39,236 INFO L87 Difference]: Start difference. First operand 1250 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:39,273 INFO L93 Difference]: Finished difference Result 1238 states and 1428 transitions. [2022-07-20 13:21:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-07-20 13:21:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:39,276 INFO L225 Difference]: With dead ends: 1238 [2022-07-20 13:21:39,276 INFO L226 Difference]: Without dead ends: 1238 [2022-07-20 13:21:39,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:39,277 INFO L413 NwaCegarLoop]: 1052 mSDtfsCounter, 1034 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:39,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 2109 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-07-20 13:21:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-07-20 13:21:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 770 states have (on average 1.8467532467532468) internal successors, (1422), 1233 states have internal predecessors, (1422), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1428 transitions. [2022-07-20 13:21:39,288 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1428 transitions. Word has length 52 [2022-07-20 13:21:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:39,288 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 1428 transitions. [2022-07-20 13:21:39,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1428 transitions. [2022-07-20 13:21:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 13:21:39,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:39,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:39,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:39,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-07-20 13:21:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:39,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773081327] [2022-07-20 13:21:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:39,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:39,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:39,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:39,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 13:21:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:39,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 13:21:39,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:39,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:39,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:40,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 13:21:40,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:40,113 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:21:40,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 13:21:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:40,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:40,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773081327] [2022-07-20 13:21:40,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773081327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:21:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070491827] [2022-07-20 13:21:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:40,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:40,124 INFO L87 Difference]: Start difference. First operand 1238 states and 1428 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:42,199 INFO L93 Difference]: Finished difference Result 1586 states and 1893 transitions. [2022-07-20 13:21:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-20 13:21:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:42,204 INFO L225 Difference]: With dead ends: 1586 [2022-07-20 13:21:42,204 INFO L226 Difference]: Without dead ends: 1586 [2022-07-20 13:21:42,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:42,205 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 1107 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:42,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 789 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 13:21:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-07-20 13:21:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1168. [2022-07-20 13:21:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 738 states have (on average 1.7859078590785908) internal successors, (1318), 1163 states have internal predecessors, (1318), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1324 transitions. [2022-07-20 13:21:42,217 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1324 transitions. Word has length 60 [2022-07-20 13:21:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:42,217 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1324 transitions. [2022-07-20 13:21:42,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1324 transitions. [2022-07-20 13:21:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 13:21:42,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:42,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:42,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:42,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:42,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:42,429 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-07-20 13:21:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:42,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057637120] [2022-07-20 13:21:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:42,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:42,431 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:42,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 13:21:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:42,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:21:42,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:42,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:42,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:21:42,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 13:21:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:42,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:42,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057637120] [2022-07-20 13:21:42,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057637120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:42,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:42,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290096367] [2022-07-20 13:21:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:42,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:21:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:21:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:42,707 INFO L87 Difference]: Start difference. First operand 1168 states and 1324 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:44,576 INFO L93 Difference]: Finished difference Result 1167 states and 1323 transitions. [2022-07-20 13:21:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:21:44,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-07-20 13:21:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:44,580 INFO L225 Difference]: With dead ends: 1167 [2022-07-20 13:21:44,581 INFO L226 Difference]: Without dead ends: 1167 [2022-07-20 13:21:44,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 13:21:44,581 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:44,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2564 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 13:21:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-20 13:21:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2022-07-20 13:21:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 738 states have (on average 1.7845528455284554) internal successors, (1317), 1162 states have internal predecessors, (1317), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1323 transitions. [2022-07-20 13:21:44,592 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1323 transitions. Word has length 65 [2022-07-20 13:21:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:44,592 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1323 transitions. [2022-07-20 13:21:44,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1323 transitions. [2022-07-20 13:21:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 13:21:44,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:44,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:44,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-20 13:21:44,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:44,803 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-07-20 13:21:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:44,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884381870] [2022-07-20 13:21:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:44,806 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:44,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 13:21:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:45,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 13:21:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:45,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:21:45,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:21:45,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:21:45,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 13:21:45,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 13:21:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:45,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:45,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:45,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884381870] [2022-07-20 13:21:45,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884381870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:45,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:45,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401367809] [2022-07-20 13:21:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:45,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:21:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:21:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:45,108 INFO L87 Difference]: Start difference. First operand 1167 states and 1323 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:47,594 INFO L93 Difference]: Finished difference Result 1166 states and 1322 transitions. [2022-07-20 13:21:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:21:47,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-07-20 13:21:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:47,598 INFO L225 Difference]: With dead ends: 1166 [2022-07-20 13:21:47,598 INFO L226 Difference]: Without dead ends: 1166 [2022-07-20 13:21:47,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 13:21:47,599 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:47,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2621 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 13:21:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-07-20 13:21:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2022-07-20 13:21:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 737 states have (on average 1.78561736770692) internal successors, (1316), 1161 states have internal predecessors, (1316), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 13:21:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1322 transitions. [2022-07-20 13:21:47,610 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1322 transitions. Word has length 65 [2022-07-20 13:21:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1322 transitions. [2022-07-20 13:21:47,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:21:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1322 transitions. [2022-07-20 13:21:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 13:21:47,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:47,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:47,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:47,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:47,821 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1088613615, now seen corresponding path program 1 times [2022-07-20 13:21:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466746693] [2022-07-20 13:21:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:47,823 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:47,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 13:21:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:48,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:21:48,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:48,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:21:48,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:48,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466746693] [2022-07-20 13:21:48,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466746693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:21:48,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:21:48,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:21:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457722158] [2022-07-20 13:21:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:21:48,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:21:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:21:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:21:48,081 INFO L87 Difference]: Start difference. First operand 1166 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:21:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:48,114 INFO L93 Difference]: Finished difference Result 1169 states and 1326 transitions. [2022-07-20 13:21:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:21:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-07-20 13:21:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:48,119 INFO L225 Difference]: With dead ends: 1169 [2022-07-20 13:21:48,119 INFO L226 Difference]: Without dead ends: 1169 [2022-07-20 13:21:48,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:21:48,120 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:48,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3031 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:21:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-20 13:21:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2022-07-20 13:21:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 739 states have (on average 1.7848443843031123) internal successors, (1319), 1164 states have internal predecessors, (1319), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:21:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1326 transitions. [2022-07-20 13:21:48,136 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1326 transitions. Word has length 73 [2022-07-20 13:21:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:48,137 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1326 transitions. [2022-07-20 13:21:48,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:21:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1326 transitions. [2022-07-20 13:21:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 13:21:48,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:48,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:48,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:48,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:48,348 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash 145492468, now seen corresponding path program 1 times [2022-07-20 13:21:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:48,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280662785] [2022-07-20 13:21:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:21:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:48,350 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:48,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 13:21:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:21:48,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:21:48,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:48,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:21:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:48,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280662785] [2022-07-20 13:21:48,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280662785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:21:48,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:21:48,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 13:21:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322937852] [2022-07-20 13:21:48,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:21:48,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 13:21:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 13:21:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 13:21:48,695 INFO L87 Difference]: Start difference. First operand 1169 states and 1326 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:48,829 INFO L93 Difference]: Finished difference Result 1181 states and 1343 transitions. [2022-07-20 13:21:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 13:21:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-07-20 13:21:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:48,833 INFO L225 Difference]: With dead ends: 1181 [2022-07-20 13:21:48,833 INFO L226 Difference]: Without dead ends: 1181 [2022-07-20 13:21:48,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-20 13:21:48,834 INFO L413 NwaCegarLoop]: 1013 mSDtfsCounter, 14 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6054 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:48,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6054 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 13:21:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-20 13:21:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1179. [2022-07-20 13:21:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 748 states have (on average 1.7834224598930482) internal successors, (1334), 1173 states have internal predecessors, (1334), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:21:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1341 transitions. [2022-07-20 13:21:48,846 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1341 transitions. Word has length 74 [2022-07-20 13:21:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:48,846 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1341 transitions. [2022-07-20 13:21:48,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1341 transitions. [2022-07-20 13:21:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 13:21:48,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:48,847 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:48,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:49,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:49,058 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2026145327, now seen corresponding path program 2 times [2022-07-20 13:21:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:49,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900496258] [2022-07-20 13:21:49,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 13:21:49,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:49,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:49,060 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:49,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 13:21:49,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 13:21:49,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:21:49,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:21:49,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:49,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:21:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:49,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900496258] [2022-07-20 13:21:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900496258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:21:49,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:21:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 13:21:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239054544] [2022-07-20 13:21:49,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:21:49,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 13:21:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 13:21:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 13:21:49,773 INFO L87 Difference]: Start difference. First operand 1179 states and 1341 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:50,254 INFO L93 Difference]: Finished difference Result 1200 states and 1369 transitions. [2022-07-20 13:21:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 13:21:50,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-07-20 13:21:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:50,257 INFO L225 Difference]: With dead ends: 1200 [2022-07-20 13:21:50,257 INFO L226 Difference]: Without dead ends: 1196 [2022-07-20 13:21:50,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-20 13:21:50,258 INFO L413 NwaCegarLoop]: 1016 mSDtfsCounter, 57 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 8092 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 8092 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 13:21:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-07-20 13:21:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1188. [2022-07-20 13:21:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 757 states have (on average 1.7780713342140027) internal successors, (1346), 1182 states have internal predecessors, (1346), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:21:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1353 transitions. [2022-07-20 13:21:50,270 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1353 transitions. Word has length 77 [2022-07-20 13:21:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:50,270 INFO L495 AbstractCegarLoop]: Abstraction has 1188 states and 1353 transitions. [2022-07-20 13:21:50,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1353 transitions. [2022-07-20 13:21:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 13:21:50,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:50,271 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:50,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:50,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:50,482 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash -570392561, now seen corresponding path program 3 times [2022-07-20 13:21:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:50,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539933429] [2022-07-20 13:21:50,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 13:21:50,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:50,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:50,484 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:50,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 13:21:51,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 13:21:51,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:21:51,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 13:21:51,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:51,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:21:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:51,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:51,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539933429] [2022-07-20 13:21:51,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539933429] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:21:51,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:21:51,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 13:21:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406489105] [2022-07-20 13:21:51,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:21:51,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 13:21:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 13:21:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-20 13:21:51,874 INFO L87 Difference]: Start difference. First operand 1188 states and 1353 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:21:54,420 INFO L93 Difference]: Finished difference Result 1230 states and 1415 transitions. [2022-07-20 13:21:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 13:21:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-07-20 13:21:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:21:54,423 INFO L225 Difference]: With dead ends: 1230 [2022-07-20 13:21:54,423 INFO L226 Difference]: Without dead ends: 1224 [2022-07-20 13:21:54,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 13:21:54,424 INFO L413 NwaCegarLoop]: 1021 mSDtfsCounter, 132 mSDsluCounter, 12194 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 13215 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 13:21:54,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 13215 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 13:21:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-07-20 13:21:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1206. [2022-07-20 13:21:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 775 states have (on average 1.7664516129032257) internal successors, (1369), 1200 states have internal predecessors, (1369), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:21:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1376 transitions. [2022-07-20 13:21:54,437 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1376 transitions. Word has length 83 [2022-07-20 13:21:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:21:54,437 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1376 transitions. [2022-07-20 13:21:54,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:21:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1376 transitions. [2022-07-20 13:21:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 13:21:54,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:21:54,438 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:21:54,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 13:21:54,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:21:54,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:21:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:21:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -322585649, now seen corresponding path program 4 times [2022-07-20 13:21:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:21:54,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798970619] [2022-07-20 13:21:54,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 13:21:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:21:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:21:54,651 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:21:54,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 13:21:55,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 13:21:55,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:21:55,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 13:21:55,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:21:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:55,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:21:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:21:56,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:21:56,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798970619] [2022-07-20 13:21:56,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798970619] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:21:56,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:21:56,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-20 13:21:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257179102] [2022-07-20 13:21:56,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:21:56,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 13:21:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:21:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 13:21:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 13:21:56,652 INFO L87 Difference]: Start difference. First operand 1206 states and 1376 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:22:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:22:06,226 INFO L93 Difference]: Finished difference Result 1286 states and 1488 transitions. [2022-07-20 13:22:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-20 13:22:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-07-20 13:22:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:22:06,231 INFO L225 Difference]: With dead ends: 1286 [2022-07-20 13:22:06,231 INFO L226 Difference]: Without dead ends: 1282 [2022-07-20 13:22:06,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-20 13:22:06,234 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 410 mSDsluCounter, 24679 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 25712 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 13:22:06,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 25712 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 13:22:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-07-20 13:22:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1240. [2022-07-20 13:22:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 809 states have (on average 1.7490729295426453) internal successors, (1415), 1234 states have internal predecessors, (1415), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:22:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1422 transitions. [2022-07-20 13:22:06,250 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1422 transitions. Word has length 95 [2022-07-20 13:22:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:22:06,250 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1422 transitions. [2022-07-20 13:22:06,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:22:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1422 transitions. [2022-07-20 13:22:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 13:22:06,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:22:06,251 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:22:06,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 13:22:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:22:06,463 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:22:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:22:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2011177647, now seen corresponding path program 5 times [2022-07-20 13:22:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:22:06,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035198001] [2022-07-20 13:22:06,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:22:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:22:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:22:06,465 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:22:06,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 13:22:07,689 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:22:07,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:22:07,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:22:07,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:22:07,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:22:07,909 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:22:07,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 13:22:07,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-20 13:22:07,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:22:07,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:22:08,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 13:22:08,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-07-20 13:22:08,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,057 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:22:08,067 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946)))) is different from true [2022-07-20 13:22:08,076 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,088 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,097 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,160 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,169 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,177 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-07-20 13:22:08,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:22:08,204 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970)))) is different from true [2022-07-20 13:22:08,234 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,241 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-07-20 13:22:08,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978)))) is different from true [2022-07-20 13:22:08,258 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,265 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:22:08,292 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,301 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,327 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993)))) is different from true [2022-07-20 13:22:08,357 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,364 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,373 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:22:08,381 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,388 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,396 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:22:08,424 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,536 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:22:08,573 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:22:08,618 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:22:08,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:22:08,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 13:22:08,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 13:22:08,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 13:22:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 899 not checked. [2022-07-20 13:22:08,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:22:09,340 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-20 13:22:09,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:22:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035198001] [2022-07-20 13:22:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035198001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:22:09,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1792530313] [2022-07-20 13:22:09,347 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:22:09,347 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:22:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:22:09,348 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:22:09,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-07-20 13:23:40,836 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:23:40,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:23:41,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:23:41,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:23:41,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:41,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:41,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:23:41,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 13:23:41,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:23:41,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:41,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:23:41,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-07-20 13:23:41,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,333 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,381 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:23:41,411 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-20 13:23:41,419 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,428 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,445 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,520 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,528 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,553 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,565 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-20 13:23:41,573 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,581 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,611 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:23:41,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,683 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,691 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,699 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,749 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,856 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,872 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,901 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:41,976 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:23:41,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:23:41,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 13:23:42,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:23:42,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-07-20 13:23:42,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:23:42,566 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-20 13:23:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1792530313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:23:42,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:23:42,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33] total 68 [2022-07-20 13:23:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738525193] [2022-07-20 13:23:42,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:23:42,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 13:23:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:23:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 13:23:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=217, Unknown=70, NotChecked=4814, Total=5256 [2022-07-20 13:23:42,574 INFO L87 Difference]: Start difference. First operand 1240 states and 1422 transitions. Second operand has 69 states, 66 states have (on average 3.196969696969697) internal successors, (211), 69 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:23:43,022 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-20 13:23:43,043 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993)))) is different from true [2022-07-20 13:23:43,052 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993)))) is different from true [2022-07-20 13:23:43,062 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:23:43,072 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:23:43,084 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:23:43,096 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:23:43,119 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-07-20 13:23:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:23:47,847 INFO L93 Difference]: Finished difference Result 1631 states and 1927 transitions. [2022-07-20 13:23:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 13:23:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 3.196969696969697) internal successors, (211), 69 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2022-07-20 13:23:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:23:47,852 INFO L225 Difference]: With dead ends: 1631 [2022-07-20 13:23:47,852 INFO L226 Difference]: Without dead ends: 1625 [2022-07-20 13:23:47,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 134 SyntacticMatches, 37 SemanticMatches, 84 ConstructedPredicates, 66 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=346, Unknown=83, NotChecked=6666, Total=7310 [2022-07-20 13:23:47,854 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 1359 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 81310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77410 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:23:47,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 3633 Invalid, 81310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3881 Invalid, 0 Unknown, 77410 Unchecked, 4.8s Time] [2022-07-20 13:23:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2022-07-20 13:23:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1239. [2022-07-20 13:23:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 809 states have (on average 1.7441285537700866) internal successors, (1411), 1233 states have internal predecessors, (1411), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:23:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1418 transitions. [2022-07-20 13:23:47,878 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1418 transitions. Word has length 117 [2022-07-20 13:23:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:23:47,879 INFO L495 AbstractCegarLoop]: Abstraction has 1239 states and 1418 transitions. [2022-07-20 13:23:47,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 3.196969696969697) internal successors, (211), 69 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:23:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1418 transitions. [2022-07-20 13:23:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 13:23:47,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:23:47,880 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:23:47,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-07-20 13:23:48,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 13:23:48,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:23:48,294 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:23:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:23:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2011177646, now seen corresponding path program 1 times [2022-07-20 13:23:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:23:48,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836996134] [2022-07-20 13:23:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:23:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:23:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:23:48,297 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:23:48,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 13:23:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:23:49,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 13:23:49,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:23:49,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:49,098 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:23:49,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:23:49,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:49,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:23:49,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:49,386 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:49,703 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:49,713 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:49,877 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:49,987 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086)))) is different from true [2022-07-20 13:23:50,084 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091)))) is different from true [2022-07-20 13:23:50,170 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:23:50,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:23:50,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:23:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-07-20 13:23:50,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:23:50,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3139) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 13:23:50,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:23:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836996134] [2022-07-20 13:23:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836996134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:23:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435381764] [2022-07-20 13:23:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:23:50,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:23:50,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:23:50,409 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:23:50,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-07-20 13:23:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:23:51,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 13:23:51,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:23:51,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:51,901 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:23:51,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:23:51,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:51,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:23:52,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:52,304 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3528)))) is different from true [2022-07-20 13:23:52,407 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:52,745 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3549) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:23:52,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-07-20 13:23:52,915 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:23:52,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:23:52,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:23:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-07-20 13:23:52,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:23:53,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3602) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 13:23:53,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1435381764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:23:53,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:23:53,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2022-07-20 13:23:53,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944265669] [2022-07-20 13:23:53,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:23:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 13:23:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:23:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 13:23:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=91, Unknown=21, NotChecked=434, Total=600 [2022-07-20 13:23:53,124 INFO L87 Difference]: Start difference. First operand 1239 states and 1418 transitions. Second operand has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 21 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:23:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:23:55,382 INFO L93 Difference]: Finished difference Result 1626 states and 1921 transitions. [2022-07-20 13:23:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 13:23:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 21 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-07-20 13:23:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:23:55,386 INFO L225 Difference]: With dead ends: 1626 [2022-07-20 13:23:55,386 INFO L226 Difference]: Without dead ends: 1624 [2022-07-20 13:23:55,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 137 SyntacticMatches, 81 SemanticMatches, 25 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=122, Unknown=23, NotChecked=490, Total=702 [2022-07-20 13:23:55,387 INFO L413 NwaCegarLoop]: 645 mSDtfsCounter, 703 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 19828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18293 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:23:55,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 3190 Invalid, 19828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1529 Invalid, 0 Unknown, 18293 Unchecked, 2.1s Time] [2022-07-20 13:23:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-07-20 13:23:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1238. [2022-07-20 13:23:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 809 states have (on average 1.7416563658838071) internal successors, (1409), 1232 states have internal predecessors, (1409), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:23:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1416 transitions. [2022-07-20 13:23:55,398 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1416 transitions. Word has length 117 [2022-07-20 13:23:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:23:55,399 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 1416 transitions. [2022-07-20 13:23:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 21 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:23:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1416 transitions. [2022-07-20 13:23:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 13:23:55,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:23:55,400 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:23:55,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-07-20 13:23:55,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 13:23:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:23:55,811 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:23:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:23:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 199761784, now seen corresponding path program 1 times [2022-07-20 13:23:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:23:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287233529] [2022-07-20 13:23:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:23:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:23:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:23:55,813 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:23:55,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 13:23:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:23:56,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 13:23:56,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:23:56,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:56,696 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:23:56,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:23:56,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:23:56,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:23:57,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:23:57,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:23:57,847 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:23:57,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:23:57,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:23:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-20 13:23:57,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:23:57,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 13:23:58,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4072))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-20 13:23:58,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:23:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287233529] [2022-07-20 13:23:58,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287233529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:23:58,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223140102] [2022-07-20 13:23:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:23:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:23:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:23:58,126 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:23:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-07-20 13:24:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:24:02,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-20 13:24:02,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:24:02,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:02,553 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:24:02,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:24:02,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:02,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:24:03,566 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:24:03,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:24:03,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:24:03,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:24:03,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:24:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-20 13:24:03,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:24:03,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 13:24:03,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 13:24:03,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4496)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-20 13:24:03,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [223140102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:24:03,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:24:03,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-20 13:24:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502398238] [2022-07-20 13:24:03,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:24:03,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 13:24:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:24:03,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 13:24:03,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=17, NotChecked=130, Total=306 [2022-07-20 13:24:03,841 INFO L87 Difference]: Start difference. First operand 1238 states and 1416 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:24:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:24:05,907 INFO L93 Difference]: Finished difference Result 1623 states and 1918 transitions. [2022-07-20 13:24:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 13:24:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-07-20 13:24:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:24:05,911 INFO L225 Difference]: With dead ends: 1623 [2022-07-20 13:24:05,911 INFO L226 Difference]: Without dead ends: 1623 [2022-07-20 13:24:05,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 143 SyntacticMatches, 93 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=154, Unknown=19, NotChecked=150, Total=380 [2022-07-20 13:24:05,911 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 706 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2303 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:24:05,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3074 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1397 Invalid, 0 Unknown, 2303 Unchecked, 2.0s Time] [2022-07-20 13:24:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-07-20 13:24:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1237. [2022-07-20 13:24:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 809 states have (on average 1.7404202719406674) internal successors, (1408), 1231 states have internal predecessors, (1408), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 13:24:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1415 transitions. [2022-07-20 13:24:05,922 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1415 transitions. Word has length 120 [2022-07-20 13:24:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:24:05,923 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1415 transitions. [2022-07-20 13:24:05,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:24:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1415 transitions. [2022-07-20 13:24:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 13:24:05,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:24:05,925 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:24:05,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-07-20 13:24:06,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-20 13:24:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:24:06,338 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 632 more)] === [2022-07-20 13:24:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:24:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash 199761785, now seen corresponding path program 1 times [2022-07-20 13:24:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:24:06,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675368901] [2022-07-20 13:24:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:24:06,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:24:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:24:06,340 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:24:06,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 13:24:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:24:07,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-20 13:24:07,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:24:07,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:07,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:07,322 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:24:07,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 13:24:07,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:07,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:24:07,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:24:07,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-07-20 13:24:07,442 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-07-20 13:24:07,449 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-07-20 13:24:07,456 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-07-20 13:24:07,463 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-07-20 13:24:07,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:24:07,519 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:24:07,525 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941)))) is different from true [2022-07-20 13:24:07,533 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-07-20 13:24:07,558 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947)))) is different from true [2022-07-20 13:24:07,566 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949)))) is different from true [2022-07-20 13:24:07,591 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953)))) is different from true [2022-07-20 13:24:07,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4958))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959)))) is different from true [2022-07-20 13:24:07,675 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4963) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:24:07,723 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968)))) is different from true [2022-07-20 13:24:07,748 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4973))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4972) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:24:07,756 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4975))) (exists ((v_ArrVal_4974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4974)))) is different from true [2022-07-20 13:24:07,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977)))) is different from true [2022-07-20 13:24:07,769 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-07-20 13:24:07,777 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981)))) is different from true [2022-07-20 13:24:07,801 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-07-20 13:24:07,826 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989)))) is different from true [2022-07-20 13:24:08,010 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-07-20 13:24:08,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:24:08,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:24:08,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 13:24:08,137 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:24:08,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:24:08,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 13:24:08,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:24:08,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 13:24:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2022-07-20 13:24:08,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:24:08,299 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-20 13:24:08,334 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2022-07-20 13:24:08,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5105)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5104) .cse0 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5104) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2022-07-20 13:24:08,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:24:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675368901] [2022-07-20 13:24:08,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675368901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:24:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836836741] [2022-07-20 13:24:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:24:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:24:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:24:08,964 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:24:08,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process