./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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_OAT_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:34:47,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:34:47,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:34:47,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:34:47,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:34:47,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:34:47,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:34:47,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:34:47,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:34:47,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:34:47,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:34:47,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:34:47,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:34:47,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:34:47,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:34:47,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:34:47,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:34:47,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:34:47,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:34:47,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:34:47,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:34:47,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:34:47,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:34:47,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:34:47,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:34:47,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:34:47,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:34:47,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:34:47,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:34:47,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:34:47,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:34:47,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:34:47,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:34:47,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:34:47,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:34:47,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:34:47,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:34:47,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:34:47,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:34:47,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:34:47,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:34:47,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 13:34:47,267 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:34:47,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:34:47,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:34:47,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:34:47,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:34:47,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:34:47,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:34:47,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:34:47,270 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:34:47,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:34:47,271 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:34:47,272 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:34:47,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:34:47,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:34:47,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:34:47,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:34:47,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:34:47,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:34:47,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 13:34:47,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 13:34:47,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:34:47,274 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2021-12-19 13:34:47,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:34:47,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:34:47,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:34:47,503 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:34:47,504 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:34:47,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2021-12-19 13:34:47,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225f75d84/3f1f0c71f235483482ce9f4b20468328/FLAG29c7f4c57 [2021-12-19 13:34:47,999 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:34:48,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2021-12-19 13:34:48,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225f75d84/3f1f0c71f235483482ce9f4b20468328/FLAG29c7f4c57 [2021-12-19 13:34:48,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225f75d84/3f1f0c71f235483482ce9f4b20468328 [2021-12-19 13:34:48,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:34:48,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:34:48,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:34:48,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:34:48,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:34:48,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:48" (1/1) ... [2021-12-19 13:34:48,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b1c24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:48, skipping insertion in model container [2021-12-19 13:34:48,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:48" (1/1) ... [2021-12-19 13:34:48,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:34:48,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:34:48,626 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_OAT_test8-1.i[33021,33034] [2021-12-19 13:34:48,718 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_OAT_test8-1.i[45234,45247] [2021-12-19 13:34:48,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:34:48,736 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-19 13:34:48,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7eececee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:48, skipping insertion in model container [2021-12-19 13:34:48,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:34:48,738 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 13:34:48,740 INFO L158 Benchmark]: Toolchain (without parser) took 398.39ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 78.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 13:34:48,741 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 70.2MB in the beginning and 70.2MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 13:34:48,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.80ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 13:34:48,743 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.17ms. Allocated memory is still 113.2MB. Free memory was 70.2MB in the beginning and 70.2MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.80ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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_OAT_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:34:50,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:34:50,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:34:50,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:34:50,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:34:50,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:34:50,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:34:50,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:34:50,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:34:50,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:34:50,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:34:50,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:34:50,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:34:50,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:34:50,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:34:50,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:34:50,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:34:50,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:34:50,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:34:50,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:34:50,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:34:50,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:34:50,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:34:50,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:34:50,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:34:50,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:34:50,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:34:50,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:34:50,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:34:50,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:34:50,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:34:50,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:34:50,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:34:50,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:34:50,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:34:50,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:34:50,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:34:50,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:34:50,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:34:50,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:34:50,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:34:50,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 13:34:50,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:34:50,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:34:50,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:34:50,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:34:50,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:34:50,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:34:50,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:34:50,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:34:50,338 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:34:50,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:34:50,339 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:34:50,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:34:50,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:34:50,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:34:50,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:34:50,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:34:50,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:34:50,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:34:50,341 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 13:34:50,342 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 13:34:50,342 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:34:50,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 13:34:50,342 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2021-12-19 13:34:50,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:34:50,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:34:50,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:34:50,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:34:50,659 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:34:50,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2021-12-19 13:34:50,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5420e26ff/b400b27d20f346c58bb02298fe01c723/FLAG087c44dcf [2021-12-19 13:34:51,135 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:34:51,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2021-12-19 13:34:51,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5420e26ff/b400b27d20f346c58bb02298fe01c723/FLAG087c44dcf [2021-12-19 13:34:51,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5420e26ff/b400b27d20f346c58bb02298fe01c723 [2021-12-19 13:34:51,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:34:51,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:34:51,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:34:51,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:34:51,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:34:51,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:51" (1/1) ... [2021-12-19 13:34:51,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ce9461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:51, skipping insertion in model container [2021-12-19 13:34:51,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:51" (1/1) ... [2021-12-19 13:34:51,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:34:51,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:34:51,905 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_OAT_test8-1.i[33021,33034] [2021-12-19 13:34:52,005 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_OAT_test8-1.i[45234,45247] [2021-12-19 13:34:52,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:34:52,033 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 13:34:52,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:34:52,054 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_OAT_test8-1.i[33021,33034] [2021-12-19 13:34:52,088 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_OAT_test8-1.i[45234,45247] [2021-12-19 13:34:52,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:34:52,093 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 13:34:52,109 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_OAT_test8-1.i[33021,33034] [2021-12-19 13:34:52,178 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_OAT_test8-1.i[45234,45247] [2021-12-19 13:34:52,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:34:52,229 INFO L208 MainTranslator]: Completed translation [2021-12-19 13:34:52,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52 WrapperNode [2021-12-19 13:34:52,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:34:52,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 13:34:52,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 13:34:52,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 13:34:52,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,314 INFO L137 Inliner]: procedures = 180, calls = 297, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1011 [2021-12-19 13:34:52,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 13:34:52,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 13:34:52,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 13:34:52,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 13:34:52,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 13:34:52,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 13:34:52,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 13:34:52,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 13:34:52,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (1/1) ... [2021-12-19 13:34:52,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:34:52,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 13:34:52,433 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) [2021-12-19 13:34:52,440 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 [2021-12-19 13:34:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 13:34:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 13:34:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 13:34:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 13:34:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-19 13:34:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-19 13:34:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2021-12-19 13:34:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 13:34:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 13:34:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 13:34:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 13:34:52,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 13:34:52,631 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 13:34:52,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 13:34:52,642 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-19 13:34:55,827 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 13:34:55,841 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 13:34:55,843 INFO L301 CfgBuilder]: Removed 62 assume(true) statements. [2021-12-19 13:34:55,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:34:55 BoogieIcfgContainer [2021-12-19 13:34:55,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 13:34:55,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 13:34:55,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 13:34:55,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 13:34:55,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:34:51" (1/3) ... [2021-12-19 13:34:55,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fd0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:34:55, skipping insertion in model container [2021-12-19 13:34:55,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:52" (2/3) ... [2021-12-19 13:34:55,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fd0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:34:55, skipping insertion in model container [2021-12-19 13:34:55,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:34:55" (3/3) ... [2021-12-19 13:34:55,855 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2021-12-19 13:34:55,860 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 13:34:55,860 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2021-12-19 13:34:55,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 13:34:55,901 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-19 13:34:55,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2021-12-19 13:34:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 1097 states, 540 states have (on average 2.240740740740741) internal successors, (1210), 1088 states have internal predecessors, (1210), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-19 13:34:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:34:55,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:34:55,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:34:55,934 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:34:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:34:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2021-12-19 13:34:55,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:34:55,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527709282] [2021-12-19 13:34:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:34:55,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:34:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:34:55,951 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) [2021-12-19 13:34:55,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-19 13:34:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:34:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:34:56,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:34:56,166 INFO L388 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 [2021-12-19 13:34:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:34:56,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:34:56,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:34:56,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527709282] [2021-12-19 13:34:56,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527709282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:34:56,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:34:56,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:34:56,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521385875] [2021-12-19 13:34:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:34:56,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:34:56,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:34:56,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:34:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:34:56,245 INFO L87 Difference]: Start difference. First operand has 1097 states, 540 states have (on average 2.240740740740741) internal successors, (1210), 1088 states have internal predecessors, (1210), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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) [2021-12-19 13:34:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:34:57,676 INFO L93 Difference]: Finished difference Result 1100 states and 1186 transitions. [2021-12-19 13:34:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:34:57,679 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 [2021-12-19 13:34:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:34:57,691 INFO L225 Difference]: With dead ends: 1100 [2021-12-19 13:34:57,691 INFO L226 Difference]: Without dead ends: 1098 [2021-12-19 13:34:57,692 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:34:57,695 INFO L933 BasicCegarLoop]: 696 mSDtfsCounter, 971 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:34:57,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 825 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-19 13:34:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-12-19 13:34:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1086. [2021-12-19 13:34:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 543 states have (on average 2.0902394106813995) internal successors, (1135), 1076 states have internal predecessors, (1135), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2021-12-19 13:34:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1177 transitions. [2021-12-19 13:34:57,754 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1177 transitions. Word has length 3 [2021-12-19 13:34:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:34:57,754 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1177 transitions. [2021-12-19 13:34:57,755 INFO L471 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) [2021-12-19 13:34:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1177 transitions. [2021-12-19 13:34:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:34:57,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:34:57,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:34:57,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-19 13:34:57,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:34:57,963 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:34:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:34:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2021-12-19 13:34:57,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:34:57,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749494543] [2021-12-19 13:34:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:34:57,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:34:57,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:34:57,966 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) [2021-12-19 13:34:57,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-19 13:34:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:34:58,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:34:58,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:34:58,079 INFO L388 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 [2021-12-19 13:34:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:34:58,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:34:58,088 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:34:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749494543] [2021-12-19 13:34:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749494543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:34:58,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:34:58,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:34:58,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74760895] [2021-12-19 13:34:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:34:58,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:34:58,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:34:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:34:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:34:58,095 INFO L87 Difference]: Start difference. First operand 1086 states and 1177 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) [2021-12-19 13:35:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:00,193 INFO L93 Difference]: Finished difference Result 1479 states and 1600 transitions. [2021-12-19 13:35:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:35:00,193 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 [2021-12-19 13:35:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:00,198 INFO L225 Difference]: With dead ends: 1479 [2021-12-19 13:35:00,198 INFO L226 Difference]: Without dead ends: 1479 [2021-12-19 13:35:00,198 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:00,199 INFO L933 BasicCegarLoop]: 976 mSDtfsCounter, 421 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:00,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1612 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 13:35:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2021-12-19 13:35:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1290. [2021-12-19 13:35:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 747 states have (on average 2.0803212851405624) internal successors, (1554), 1279 states have internal predecessors, (1554), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-19 13:35:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1598 transitions. [2021-12-19 13:35:00,224 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1598 transitions. Word has length 3 [2021-12-19 13:35:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:00,224 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 1598 transitions. [2021-12-19 13:35:00,224 INFO L471 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) [2021-12-19 13:35:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1598 transitions. [2021-12-19 13:35:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-19 13:35:00,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:00,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:00,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:00,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:00,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2021-12-19 13:35:00,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:00,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003886251] [2021-12-19 13:35:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:00,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:00,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:00,434 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) [2021-12-19 13:35:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-19 13:35:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:00,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:35:00,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:00,572 INFO L388 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 [2021-12-19 13:35:00,579 INFO L388 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 [2021-12-19 13:35:00,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:35:00,637 INFO L388 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 [2021-12-19 13:35:00,646 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:35:00,646 INFO L388 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 14 treesize of output 14 [2021-12-19 13:35:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:00,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:00,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:00,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003886251] [2021-12-19 13:35:00,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003886251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:00,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:00,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:00,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65083863] [2021-12-19 13:35:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:00,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:00,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:00,670 INFO L87 Difference]: Start difference. First operand 1290 states and 1598 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) [2021-12-19 13:35:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:02,566 INFO L93 Difference]: Finished difference Result 1295 states and 1601 transitions. [2021-12-19 13:35:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:02,567 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 [2021-12-19 13:35:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:02,570 INFO L225 Difference]: With dead ends: 1295 [2021-12-19 13:35:02,571 INFO L226 Difference]: Without dead ends: 1295 [2021-12-19 13:35:02,571 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:02,572 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 1073 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:02,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1079 Valid, 591 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-19 13:35:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2021-12-19 13:35:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1075. [2021-12-19 13:35:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 543 states have (on average 2.0681399631675874) internal successors, (1123), 1065 states have internal predecessors, (1123), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2021-12-19 13:35:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1165 transitions. [2021-12-19 13:35:02,594 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1165 transitions. Word has length 7 [2021-12-19 13:35:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:02,594 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 1165 transitions. [2021-12-19 13:35:02,594 INFO L471 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) [2021-12-19 13:35:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1165 transitions. [2021-12-19 13:35:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 13:35:02,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:02,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:02,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:02,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:02,801 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2021-12-19 13:35:02,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781360751] [2021-12-19 13:35:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:02,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:02,805 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) [2021-12-19 13:35:02,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-19 13:35:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:02,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:35:02,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:02,904 INFO L388 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 [2021-12-19 13:35:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:02,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:02,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:02,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781360751] [2021-12-19 13:35:02,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781360751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:02,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:02,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:35:02,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962950553] [2021-12-19 13:35:02,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:02,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:35:02,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:02,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:35:02,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:35:02,916 INFO L87 Difference]: Start difference. First operand 1075 states and 1165 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) [2021-12-19 13:35:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:04,455 INFO L93 Difference]: Finished difference Result 1402 states and 1519 transitions. [2021-12-19 13:35:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:35:04,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 [2021-12-19 13:35:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:04,459 INFO L225 Difference]: With dead ends: 1402 [2021-12-19 13:35:04,459 INFO L226 Difference]: Without dead ends: 1402 [2021-12-19 13:35:04,459 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:04,460 INFO L933 BasicCegarLoop]: 993 mSDtfsCounter, 988 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:04,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 1298 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-19 13:35:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2021-12-19 13:35:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1028. [2021-12-19 13:35:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 543 states have (on average 1.9797421731123388) internal successors, (1075), 1018 states have internal predecessors, (1075), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2021-12-19 13:35:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1117 transitions. [2021-12-19 13:35:04,514 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1117 transitions. Word has length 8 [2021-12-19 13:35:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:04,514 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1117 transitions. [2021-12-19 13:35:04,514 INFO L471 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) [2021-12-19 13:35:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1117 transitions. [2021-12-19 13:35:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 13:35:04,515 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:04,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:04,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:04,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:04,722 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2021-12-19 13:35:04,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:04,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559257899] [2021-12-19 13:35:04,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:04,723 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:04,724 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) [2021-12-19 13:35:04,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-19 13:35:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:04,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:35:04,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:04,827 INFO L388 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 [2021-12-19 13:35:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:04,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:04,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:04,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559257899] [2021-12-19 13:35:04,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559257899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:04,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:04,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:35:04,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037934274] [2021-12-19 13:35:04,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:04,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:35:04,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:35:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:35:04,845 INFO L87 Difference]: Start difference. First operand 1028 states and 1117 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) [2021-12-19 13:35:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:06,831 INFO L93 Difference]: Finished difference Result 1497 states and 1619 transitions. [2021-12-19 13:35:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:35:06,849 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 [2021-12-19 13:35:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:06,853 INFO L225 Difference]: With dead ends: 1497 [2021-12-19 13:35:06,853 INFO L226 Difference]: Without dead ends: 1497 [2021-12-19 13:35:06,853 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:06,854 INFO L933 BasicCegarLoop]: 1212 mSDtfsCounter, 686 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:06,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 1698 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-19 13:35:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-12-19 13:35:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1270. [2021-12-19 13:35:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 793 states have (on average 1.978562421185372) internal successors, (1569), 1258 states have internal predecessors, (1569), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1615 transitions. [2021-12-19 13:35:06,882 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1615 transitions. Word has length 8 [2021-12-19 13:35:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:06,882 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1615 transitions. [2021-12-19 13:35:06,883 INFO L471 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) [2021-12-19 13:35:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1615 transitions. [2021-12-19 13:35:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-19 13:35:06,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:06,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:06,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:07,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:07,091 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -652228184, now seen corresponding path program 1 times [2021-12-19 13:35:07,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773800352] [2021-12-19 13:35:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:07,092 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:07,093 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) [2021-12-19 13:35:07,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-19 13:35:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:07,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:35:07,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:07,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:35:07,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:35:07,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:35:07,270 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 13:35:07,270 INFO L388 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 30 treesize of output 36 [2021-12-19 13:35:07,305 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 13:35:07,305 INFO L388 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 67 treesize of output 23 [2021-12-19 13:35:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:07,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:07,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:07,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773800352] [2021-12-19 13:35:07,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773800352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:07,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:07,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:07,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229705136] [2021-12-19 13:35:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:07,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:07,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:07,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:07,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:07,321 INFO L87 Difference]: Start difference. First operand 1270 states and 1615 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:08,292 INFO L93 Difference]: Finished difference Result 1784 states and 2339 transitions. [2021-12-19 13:35:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-19 13:35:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:08,299 INFO L225 Difference]: With dead ends: 1784 [2021-12-19 13:35:08,299 INFO L226 Difference]: Without dead ends: 1784 [2021-12-19 13:35:08,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:35:08,300 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 356 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:08,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 3028 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-19 13:35:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2021-12-19 13:35:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1272. [2021-12-19 13:35:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 795 states have (on average 1.9761006289308176) internal successors, (1571), 1260 states have internal predecessors, (1571), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1617 transitions. [2021-12-19 13:35:08,321 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1617 transitions. Word has length 10 [2021-12-19 13:35:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:08,321 INFO L470 AbstractCegarLoop]: Abstraction has 1272 states and 1617 transitions. [2021-12-19 13:35:08,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1617 transitions. [2021-12-19 13:35:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-19 13:35:08,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:08,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:08,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-19 13:35:08,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:08,532 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2021-12-19 13:35:08,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:08,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131663032] [2021-12-19 13:35:08,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:08,533 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:08,534 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) [2021-12-19 13:35:08,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-19 13:35:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:08,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 13:35:08,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:08,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:08,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131663032] [2021-12-19 13:35:08,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131663032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:08,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:08,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:08,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547520714] [2021-12-19 13:35:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:08,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:35:08,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:35:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:35:08,682 INFO L87 Difference]: Start difference. First operand 1272 states and 1617 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) [2021-12-19 13:35:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:08,700 INFO L93 Difference]: Finished difference Result 1241 states and 1585 transitions. [2021-12-19 13:35:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:35:08,701 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 [2021-12-19 13:35:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:08,704 INFO L225 Difference]: With dead ends: 1241 [2021-12-19 13:35:08,704 INFO L226 Difference]: Without dead ends: 1241 [2021-12-19 13:35:08,705 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:08,705 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 964 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1144 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 [2021-12-19 13:35:08,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 1144 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:35:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-12-19 13:35:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1230. [2021-12-19 13:35:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 777 states have (on average 1.9665379665379665) internal successors, (1528), 1218 states have internal predecessors, (1528), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1574 transitions. [2021-12-19 13:35:08,722 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1574 transitions. Word has length 18 [2021-12-19 13:35:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:08,722 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1574 transitions. [2021-12-19 13:35:08,722 INFO L471 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) [2021-12-19 13:35:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1574 transitions. [2021-12-19 13:35:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-19 13:35:08,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:08,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:08,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:08,931 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2021-12-19 13:35:08,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:08,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832680393] [2021-12-19 13:35:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:08,933 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:08,934 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) [2021-12-19 13:35:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-19 13:35:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:09,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:35:09,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:09,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:09,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:09,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832680393] [2021-12-19 13:35:09,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832680393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:09,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:09,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:09,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760696876] [2021-12-19 13:35:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:09,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:09,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:09,095 INFO L87 Difference]: Start difference. First operand 1230 states and 1574 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) [2021-12-19 13:35:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:09,144 INFO L93 Difference]: Finished difference Result 1220 states and 1557 transitions. [2021-12-19 13:35:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:09,146 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 [2021-12-19 13:35:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:09,149 INFO L225 Difference]: With dead ends: 1220 [2021-12-19 13:35:09,149 INFO L226 Difference]: Without dead ends: 1220 [2021-12-19 13:35:09,150 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:09,150 INFO L933 BasicCegarLoop]: 1007 mSDtfsCounter, 935 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2099 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 [2021-12-19 13:35:09,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 2099 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:35:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-12-19 13:35:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1208. [2021-12-19 13:35:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 769 states have (on average 1.9492847854356308) internal successors, (1499), 1196 states have internal predecessors, (1499), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1545 transitions. [2021-12-19 13:35:09,168 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1545 transitions. Word has length 20 [2021-12-19 13:35:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:09,169 INFO L470 AbstractCegarLoop]: Abstraction has 1208 states and 1545 transitions. [2021-12-19 13:35:09,169 INFO L471 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) [2021-12-19 13:35:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1545 transitions. [2021-12-19 13:35:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-19 13:35:09,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:09,170 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:09,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:09,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:09,379 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2021-12-19 13:35:09,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:09,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140933555] [2021-12-19 13:35:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:09,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:09,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:09,381 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) [2021-12-19 13:35:09,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-19 13:35:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:09,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:35:09,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:09,536 INFO L388 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 [2021-12-19 13:35:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:09,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:09,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:09,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140933555] [2021-12-19 13:35:09,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140933555] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:09,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:09,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:09,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290268468] [2021-12-19 13:35:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:09,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:09,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:09,623 INFO L87 Difference]: Start difference. First operand 1208 states and 1545 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) [2021-12-19 13:35:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:11,136 INFO L93 Difference]: Finished difference Result 1796 states and 2367 transitions. [2021-12-19 13:35:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:11,137 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 [2021-12-19 13:35:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:11,142 INFO L225 Difference]: With dead ends: 1796 [2021-12-19 13:35:11,142 INFO L226 Difference]: Without dead ends: 1796 [2021-12-19 13:35:11,142 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:11,143 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 2102 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:11,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2104 Valid, 995 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-19 13:35:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2021-12-19 13:35:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1204. [2021-12-19 13:35:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 769 states have (on average 1.9440832249674902) internal successors, (1495), 1192 states have internal predecessors, (1495), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1541 transitions. [2021-12-19 13:35:11,162 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1541 transitions. Word has length 34 [2021-12-19 13:35:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:11,163 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 1541 transitions. [2021-12-19 13:35:11,163 INFO L471 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) [2021-12-19 13:35:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1541 transitions. [2021-12-19 13:35:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-19 13:35:11,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:11,164 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:11,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:11,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:11,371 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2021-12-19 13:35:11,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064153658] [2021-12-19 13:35:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:11,372 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:11,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:11,373 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) [2021-12-19 13:35:11,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-19 13:35:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:11,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:35:11,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:11,530 INFO L388 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 [2021-12-19 13:35:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:11,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:11,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:11,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064153658] [2021-12-19 13:35:11,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064153658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:11,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:11,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:11,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087731853] [2021-12-19 13:35:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:11,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:11,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:11,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:11,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:11,685 INFO L87 Difference]: Start difference. First operand 1204 states and 1541 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) [2021-12-19 13:35:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:14,056 INFO L93 Difference]: Finished difference Result 1438 states and 1552 transitions. [2021-12-19 13:35:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:14,057 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 [2021-12-19 13:35:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:14,061 INFO L225 Difference]: With dead ends: 1438 [2021-12-19 13:35:14,061 INFO L226 Difference]: Without dead ends: 1438 [2021-12-19 13:35:14,061 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:14,061 INFO L933 BasicCegarLoop]: 751 mSDtfsCounter, 1176 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:14,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1176 Valid, 1729 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-19 13:35:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-12-19 13:35:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1200. [2021-12-19 13:35:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 769 states have (on average 1.9388816644993498) internal successors, (1491), 1188 states have internal predecessors, (1491), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1537 transitions. [2021-12-19 13:35:14,076 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1537 transitions. Word has length 34 [2021-12-19 13:35:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:14,076 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1537 transitions. [2021-12-19 13:35:14,076 INFO L471 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) [2021-12-19 13:35:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1537 transitions. [2021-12-19 13:35:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-19 13:35:14,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:14,077 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:14,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:14,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:14,285 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1045534242, now seen corresponding path program 1 times [2021-12-19 13:35:14,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:14,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322622507] [2021-12-19 13:35:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:14,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:14,288 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) [2021-12-19 13:35:14,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-19 13:35:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:14,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:35:14,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:14,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:14,554 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:14,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322622507] [2021-12-19 13:35:14,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322622507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:14,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:14,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:14,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779362671] [2021-12-19 13:35:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:14,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:14,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:14,556 INFO L87 Difference]: Start difference. First operand 1200 states and 1537 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:14,595 INFO L93 Difference]: Finished difference Result 1205 states and 1538 transitions. [2021-12-19 13:35:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-12-19 13:35:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:14,603 INFO L225 Difference]: With dead ends: 1205 [2021-12-19 13:35:14,603 INFO L226 Difference]: Without dead ends: 1205 [2021-12-19 13:35:14,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:35:14,604 INFO L933 BasicCegarLoop]: 1001 mSDtfsCounter, 911 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 2077 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 [2021-12-19 13:35:14,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 2077 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:35:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2021-12-19 13:35:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1194. [2021-12-19 13:35:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 763 states have (on average 1.9410222804718218) internal successors, (1481), 1182 states have internal predecessors, (1481), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-19 13:35:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1527 transitions. [2021-12-19 13:35:14,618 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1527 transitions. Word has length 49 [2021-12-19 13:35:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:14,619 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 1527 transitions. [2021-12-19 13:35:14,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1527 transitions. [2021-12-19 13:35:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-19 13:35:14,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:14,620 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:14,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:14,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:14,832 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -551406574, now seen corresponding path program 1 times [2021-12-19 13:35:14,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137957592] [2021-12-19 13:35:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:14,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:14,834 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) [2021-12-19 13:35:14,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-19 13:35:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:15,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:35:15,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:15,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:15,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137957592] [2021-12-19 13:35:15,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137957592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:15,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:15,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:15,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67417385] [2021-12-19 13:35:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:15,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:35:15,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:35:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:35:15,300 INFO L87 Difference]: Start difference. First operand 1194 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:15,476 INFO L93 Difference]: Finished difference Result 1736 states and 2264 transitions. [2021-12-19 13:35:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:35:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-12-19 13:35:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:15,481 INFO L225 Difference]: With dead ends: 1736 [2021-12-19 13:35:15,481 INFO L226 Difference]: Without dead ends: 1736 [2021-12-19 13:35:15,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:35:15,482 INFO L933 BasicCegarLoop]: 1210 mSDtfsCounter, 407 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:15,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 2068 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 13:35:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-12-19 13:35:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1557. [2021-12-19 13:35:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1124 states have (on average 1.9225978647686832) internal successors, (2161), 1543 states have internal predecessors, (2161), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-19 13:35:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2211 transitions. [2021-12-19 13:35:15,501 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2211 transitions. Word has length 57 [2021-12-19 13:35:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:15,501 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 2211 transitions. [2021-12-19 13:35:15,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:35:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2211 transitions. [2021-12-19 13:35:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-19 13:35:15,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:15,503 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:15,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:15,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:15,712 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2021-12-19 13:35:15,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:15,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082123997] [2021-12-19 13:35:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:15,713 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:15,715 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) [2021-12-19 13:35:15,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-19 13:35:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:16,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:35:16,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:16,021 INFO L388 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 [2021-12-19 13:35:16,026 INFO L388 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 [2021-12-19 13:35:16,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:35:16,441 INFO L388 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 [2021-12-19 13:35:16,449 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:35:16,449 INFO L388 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 14 treesize of output 14 [2021-12-19 13:35:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:16,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:16,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:16,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082123997] [2021-12-19 13:35:16,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082123997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:16,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:16,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:35:16,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046532615] [2021-12-19 13:35:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:16,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:16,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:16,462 INFO L87 Difference]: Start difference. First operand 1557 states and 2211 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) [2021-12-19 13:35:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:17,849 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2021-12-19 13:35:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:17,850 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 [2021-12-19 13:35:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:17,855 INFO L225 Difference]: With dead ends: 1528 [2021-12-19 13:35:17,855 INFO L226 Difference]: Without dead ends: 1528 [2021-12-19 13:35:17,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:17,856 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 877 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:17,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 528 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-19 13:35:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2021-12-19 13:35:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1109. [2021-12-19 13:35:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 719 states have (on average 1.8094575799721835) internal successors, (1301), 1098 states have internal predecessors, (1301), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-19 13:35:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1345 transitions. [2021-12-19 13:35:17,869 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1345 transitions. Word has length 60 [2021-12-19 13:35:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:17,869 INFO L470 AbstractCegarLoop]: Abstraction has 1109 states and 1345 transitions. [2021-12-19 13:35:17,870 INFO L471 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) [2021-12-19 13:35:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1345 transitions. [2021-12-19 13:35:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-19 13:35:17,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:17,870 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:17,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:18,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:18,081 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2021-12-19 13:35:18,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:18,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285885427] [2021-12-19 13:35:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:18,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:18,083 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) [2021-12-19 13:35:18,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-19 13:35:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:18,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 13:35:18,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:18,366 INFO L388 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 [2021-12-19 13:35:18,377 INFO L388 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 [2021-12-19 13:35:18,397 INFO L388 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 24 treesize of output 12 [2021-12-19 13:35:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:18,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:18,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:18,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285885427] [2021-12-19 13:35:18,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285885427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:18,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:18,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:18,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646805775] [2021-12-19 13:35:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:18,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:35:18,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:18,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:35:18,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:35:18,409 INFO L87 Difference]: Start difference. First operand 1109 states and 1345 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) [2021-12-19 13:35:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:20,054 INFO L93 Difference]: Finished difference Result 1108 states and 1344 transitions. [2021-12-19 13:35:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:35:20,054 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 [2021-12-19 13:35:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:20,057 INFO L225 Difference]: With dead ends: 1108 [2021-12-19 13:35:20,057 INFO L226 Difference]: Without dead ends: 1108 [2021-12-19 13:35:20,057 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:20,057 INFO L933 BasicCegarLoop]: 959 mSDtfsCounter, 4 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:20,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2532 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-19 13:35:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-12-19 13:35:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2021-12-19 13:35:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 719 states have (on average 1.8080667593880388) internal successors, (1300), 1097 states have internal predecessors, (1300), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-19 13:35:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1344 transitions. [2021-12-19 13:35:20,069 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1344 transitions. Word has length 65 [2021-12-19 13:35:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:20,069 INFO L470 AbstractCegarLoop]: Abstraction has 1108 states and 1344 transitions. [2021-12-19 13:35:20,069 INFO L471 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) [2021-12-19 13:35:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1344 transitions. [2021-12-19 13:35:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-19 13:35:20,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:20,070 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:20,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:20,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:20,280 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2021-12-19 13:35:20,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:20,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047860543] [2021-12-19 13:35:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:20,281 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:20,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:20,283 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) [2021-12-19 13:35:20,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-19 13:35:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:20,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 13:35:20,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:20,572 INFO L388 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 [2021-12-19 13:35:20,588 INFO L388 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 [2021-12-19 13:35:20,594 INFO L388 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 [2021-12-19 13:35:20,634 INFO L388 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 [2021-12-19 13:35:20,641 INFO L388 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 [2021-12-19 13:35:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:20,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:20,653 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:20,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047860543] [2021-12-19 13:35:20,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047860543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:20,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:20,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:20,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629978229] [2021-12-19 13:35:20,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:20,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:35:20,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:20,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:35:20,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:35:20,656 INFO L87 Difference]: Start difference. First operand 1108 states and 1344 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) [2021-12-19 13:35:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:22,782 INFO L93 Difference]: Finished difference Result 1107 states and 1343 transitions. [2021-12-19 13:35:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:35:22,783 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 [2021-12-19 13:35:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:22,786 INFO L225 Difference]: With dead ends: 1107 [2021-12-19 13:35:22,786 INFO L226 Difference]: Without dead ends: 1107 [2021-12-19 13:35:22,786 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:22,787 INFO L933 BasicCegarLoop]: 959 mSDtfsCounter, 2 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:22,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2577 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-19 13:35:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-12-19 13:35:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2021-12-19 13:35:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 718 states have (on average 1.809192200557103) internal successors, (1299), 1096 states have internal predecessors, (1299), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-19 13:35:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1343 transitions. [2021-12-19 13:35:22,799 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1343 transitions. Word has length 65 [2021-12-19 13:35:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:22,799 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 1343 transitions. [2021-12-19 13:35:22,800 INFO L471 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) [2021-12-19 13:35:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1343 transitions. [2021-12-19 13:35:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:35:22,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:22,800 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:22,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:23,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:23,005 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1441347596, now seen corresponding path program 1 times [2021-12-19 13:35:23,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:23,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664733324] [2021-12-19 13:35:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:23,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:23,007 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) [2021-12-19 13:35:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-19 13:35:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:23,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:35:23,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:23,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:35:23,341 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:23,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664733324] [2021-12-19 13:35:23,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664733324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:35:23,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:35:23,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:35:23,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591282447] [2021-12-19 13:35:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:35:23,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:35:23,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:35:23,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:35:23,343 INFO L87 Difference]: Start difference. First operand 1107 states and 1343 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) [2021-12-19 13:35:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:23,374 INFO L93 Difference]: Finished difference Result 1110 states and 1347 transitions. [2021-12-19 13:35:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:35:23,375 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 [2021-12-19 13:35:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:23,378 INFO L225 Difference]: With dead ends: 1110 [2021-12-19 13:35:23,378 INFO L226 Difference]: Without dead ends: 1110 [2021-12-19 13:35:23,379 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:23,379 INFO L933 BasicCegarLoop]: 959 mSDtfsCounter, 2 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2872 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 [2021-12-19 13:35:23,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:35:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-12-19 13:35:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2021-12-19 13:35:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 720 states have (on average 1.8083333333333333) internal successors, (1302), 1099 states have internal predecessors, (1302), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:35:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1347 transitions. [2021-12-19 13:35:23,395 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1347 transitions. Word has length 73 [2021-12-19 13:35:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:23,395 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1347 transitions. [2021-12-19 13:35:23,395 INFO L471 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) [2021-12-19 13:35:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1347 transitions. [2021-12-19 13:35:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-19 13:35:23,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:23,396 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:23,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:23,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:23,606 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1660884519, now seen corresponding path program 1 times [2021-12-19 13:35:23,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:23,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698161117] [2021-12-19 13:35:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:23,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:23,612 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) [2021-12-19 13:35:23,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-19 13:35:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:23,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:35:23,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:23,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:24,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:24,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698161117] [2021-12-19 13:35:24,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698161117] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:35:24,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:35:24,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-19 13:35:24,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930355699] [2021-12-19 13:35:24,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:35:24,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 13:35:24,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 13:35:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:35:24,054 INFO L87 Difference]: Start difference. First operand 1110 states and 1347 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) [2021-12-19 13:35:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:24,178 INFO L93 Difference]: Finished difference Result 1122 states and 1364 transitions. [2021-12-19 13:35:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:35:24,179 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 [2021-12-19 13:35:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:24,182 INFO L225 Difference]: With dead ends: 1122 [2021-12-19 13:35:24,182 INFO L226 Difference]: Without dead ends: 1122 [2021-12-19 13:35:24,182 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:24,182 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 13 mSDsluCounter, 4775 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5735 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:24,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 5735 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:35:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2021-12-19 13:35:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1120. [2021-12-19 13:35:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 729 states have (on average 1.8065843621399178) internal successors, (1317), 1108 states have internal predecessors, (1317), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:35:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1362 transitions. [2021-12-19 13:35:24,195 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1362 transitions. Word has length 74 [2021-12-19 13:35:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:24,196 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 1362 transitions. [2021-12-19 13:35:24,196 INFO L471 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) [2021-12-19 13:35:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1362 transitions. [2021-12-19 13:35:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-19 13:35:24,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:24,196 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:24,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:24,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:24,406 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 925745996, now seen corresponding path program 2 times [2021-12-19 13:35:24,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:24,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64316633] [2021-12-19 13:35:24,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 13:35:24,407 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:24,408 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) [2021-12-19 13:35:24,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-19 13:35:24,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 13:35:24,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:35:24,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 13:35:24,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:24,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:25,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64316633] [2021-12-19 13:35:25,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64316633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:35:25,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:35:25,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-19 13:35:25,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265973054] [2021-12-19 13:35:25,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:35:25,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 13:35:25,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 13:35:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-19 13:35:25,199 INFO L87 Difference]: Start difference. First operand 1120 states and 1362 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) [2021-12-19 13:35:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:25,638 INFO L93 Difference]: Finished difference Result 1141 states and 1390 transitions. [2021-12-19 13:35:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-19 13:35:25,639 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 [2021-12-19 13:35:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:25,642 INFO L225 Difference]: With dead ends: 1141 [2021-12-19 13:35:25,642 INFO L226 Difference]: Without dead ends: 1137 [2021-12-19 13:35:25,642 INFO L932 BasicCegarLoop]: 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 [2021-12-19 13:35:25,643 INFO L933 BasicCegarLoop]: 963 mSDtfsCounter, 56 mSDsluCounter, 4798 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:25,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 5761 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 13:35:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-19 13:35:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1129. [2021-12-19 13:35:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 738 states have (on average 1.8008130081300813) internal successors, (1329), 1117 states have internal predecessors, (1329), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:35:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1374 transitions. [2021-12-19 13:35:25,656 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1374 transitions. Word has length 77 [2021-12-19 13:35:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:25,656 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1374 transitions. [2021-12-19 13:35:25,657 INFO L471 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) [2021-12-19 13:35:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1374 transitions. [2021-12-19 13:35:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 13:35:25,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:25,657 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:25,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:25,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:25,868 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash -181581780, now seen corresponding path program 3 times [2021-12-19 13:35:25,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:25,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600648505] [2021-12-19 13:35:25,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 13:35:25,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:25,871 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) [2021-12-19 13:35:25,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-19 13:35:26,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 13:35:26,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:35:26,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 13:35:26,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:26,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:27,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600648505] [2021-12-19 13:35:27,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600648505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:35:27,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:35:27,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-19 13:35:27,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848873737] [2021-12-19 13:35:27,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:35:27,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-19 13:35:27,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-19 13:35:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-19 13:35:27,355 INFO L87 Difference]: Start difference. First operand 1129 states and 1374 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) [2021-12-19 13:35:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:29,926 INFO L93 Difference]: Finished difference Result 1171 states and 1436 transitions. [2021-12-19 13:35:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-19 13:35:29,927 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 [2021-12-19 13:35:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:29,935 INFO L225 Difference]: With dead ends: 1171 [2021-12-19 13:35:29,935 INFO L226 Difference]: Without dead ends: 1165 [2021-12-19 13:35:29,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-19 13:35:29,937 INFO L933 BasicCegarLoop]: 968 mSDtfsCounter, 159 mSDsluCounter, 12510 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 13478 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:29,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 13478 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-19 13:35:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-19 13:35:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1147. [2021-12-19 13:35:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 756 states have (on average 1.7883597883597884) internal successors, (1352), 1135 states have internal predecessors, (1352), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:35:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1397 transitions. [2021-12-19 13:35:29,952 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1397 transitions. Word has length 83 [2021-12-19 13:35:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:29,953 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 1397 transitions. [2021-12-19 13:35:29,953 INFO L471 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) [2021-12-19 13:35:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1397 transitions. [2021-12-19 13:35:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-19 13:35:29,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:29,954 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:29,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:30,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:30,165 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -244524564, now seen corresponding path program 4 times [2021-12-19 13:35:30,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:30,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151474028] [2021-12-19 13:35:30,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 13:35:30,166 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:30,167 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) [2021-12-19 13:35:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-19 13:35:30,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 13:35:30,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:35:30,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 13:35:30,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:30,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:35:32,251 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:32,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151474028] [2021-12-19 13:35:32,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151474028] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:35:32,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:35:32,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-19 13:35:32,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692269270] [2021-12-19 13:35:32,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:35:32,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-19 13:35:32,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-19 13:35:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-19 13:35:32,254 INFO L87 Difference]: Start difference. First operand 1147 states and 1397 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) [2021-12-19 13:35:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:41,829 INFO L93 Difference]: Finished difference Result 1227 states and 1509 transitions. [2021-12-19 13:35:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-19 13:35:41,830 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 [2021-12-19 13:35:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:41,847 INFO L225 Difference]: With dead ends: 1227 [2021-12-19 13:35:41,848 INFO L226 Difference]: Without dead ends: 1223 [2021-12-19 13:35:41,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-19 13:35:41,851 INFO L933 BasicCegarLoop]: 980 mSDtfsCounter, 393 mSDsluCounter, 24359 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 25339 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:41,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 25339 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-19 13:35:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2021-12-19 13:35:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1181. [2021-12-19 13:35:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 790 states have (on average 1.769620253164557) internal successors, (1398), 1169 states have internal predecessors, (1398), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:35:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1443 transitions. [2021-12-19 13:35:41,875 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1443 transitions. Word has length 95 [2021-12-19 13:35:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:41,876 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1443 transitions. [2021-12-19 13:35:41,876 INFO L471 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) [2021-12-19 13:35:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1443 transitions. [2021-12-19 13:35:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-19 13:35:41,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:41,879 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:35:41,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:42,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:42,091 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:35:42,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -713567284, now seen corresponding path program 5 times [2021-12-19 13:35:42,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:42,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651167512] [2021-12-19 13:35:42,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:35:42,092 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:42,093 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) [2021-12-19 13:35:42,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-19 13:35:43,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:35:43,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:35:43,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 13:35:43,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:43,339 INFO L388 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 [2021-12-19 13:35:43,460 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:35:43,461 INFO L388 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 20 treesize of output 27 [2021-12-19 13:35:43,484 INFO L388 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 [2021-12-19 13:35:43,571 INFO L388 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 [2021-12-19 13:35:44,118 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928)))) is different from true [2021-12-19 13:35:44,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929)))) is different from true [2021-12-19 13:35:44,292 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934)))) is different from true [2021-12-19 13:35:44,829 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (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)))) is different from true [2021-12-19 13:35:45,110 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:35:45,110 INFO L388 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 37 treesize of output 38 [2021-12-19 13:35:45,170 INFO L388 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 34 treesize of output 16 [2021-12-19 13:35:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2021-12-19 13:35:45,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:45,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:35:45,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651167512] [2021-12-19 13:35:45,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651167512] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:35:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [197485951] [2021-12-19 13:35:45,410 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:35:45,410 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:35:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:35:45,412 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:35:45,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-19 13:37:20,723 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:37:20,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:37:20,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-19 13:37:21,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:37:21,014 INFO L388 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 [2021-12-19 13:37:21,133 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:37:21,133 INFO L388 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 20 treesize of output 27 [2021-12-19 13:37:21,158 INFO L388 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 [2021-12-19 13:37:21,209 INFO L388 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 [2021-12-19 13:37:21,473 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383)))) is different from true [2021-12-19 13:37:21,556 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2021-12-19 13:37:21,646 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389)))) is different from true [2021-12-19 13:37:21,703 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391)))) is different from true [2021-12-19 13:37:22,376 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2021-12-19 13:37:22,541 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| v_arrayElimCell_16)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_16)) (_ bv1 1))))) (exists ((v_ArrVal_2418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2418)))) is different from true [2021-12-19 13:37:22,674 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:37:22,674 INFO L388 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 37 treesize of output 38 [2021-12-19 13:37:22,728 INFO L388 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 34 treesize of output 16 [2021-12-19 13:37:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2021-12-19 13:37:22,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:37:22,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [197485951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:37:22,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:37:22,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2021-12-19 13:37:22,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573490908] [2021-12-19 13:37:22,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:37:22,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-19 13:37:22,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:37:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-19 13:37:22,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=104, Unknown=21, NotChecked=330, Total=506 [2021-12-19 13:37:22,931 INFO L87 Difference]: Start difference. First operand 1181 states and 1443 transitions. Second operand has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 19 states have internal predecessors, (92), 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) [2021-12-19 13:37:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:37:24,767 INFO L93 Difference]: Finished difference Result 1191 states and 1451 transitions. [2021-12-19 13:37:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 13:37:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 19 states have internal predecessors, (92), 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 [2021-12-19 13:37:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:37:24,769 INFO L225 Difference]: With dead ends: 1191 [2021-12-19 13:37:24,769 INFO L226 Difference]: Without dead ends: 1187 [2021-12-19 13:37:24,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 139 SyntacticMatches, 81 SemanticMatches, 23 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=139, Unknown=23, NotChecked=374, Total=600 [2021-12-19 13:37:24,770 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 802 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 12860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11559 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:37:24,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 2522 Invalid, 12860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1293 Invalid, 0 Unknown, 11559 Unchecked, 1.7s Time] [2021-12-19 13:37:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-12-19 13:37:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1180. [2021-12-19 13:37:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 790 states have (on average 1.7632911392405064) internal successors, (1393), 1168 states have internal predecessors, (1393), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:37:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1438 transitions. [2021-12-19 13:37:24,791 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1438 transitions. Word has length 117 [2021-12-19 13:37:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:37:24,791 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1438 transitions. [2021-12-19 13:37:24,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 19 states have internal predecessors, (92), 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) [2021-12-19 13:37:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1438 transitions. [2021-12-19 13:37:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-19 13:37:24,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:37:24,793 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:37:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-19 13:37:25,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2021-12-19 13:37:25,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:37:25,203 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:37:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:37:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -713567283, now seen corresponding path program 1 times [2021-12-19 13:37:25,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:37:25,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330974910] [2021-12-19 13:37:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:37:25,205 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:37:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:37:25,205 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) [2021-12-19 13:37:25,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-19 13:37:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:37:25,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-19 13:37:25,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:37:25,910 INFO L388 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 [2021-12-19 13:37:26,022 INFO L388 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 [2021-12-19 13:37:26,033 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:37:26,033 INFO L388 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 14 treesize of output 14 [2021-12-19 13:37:26,051 INFO L388 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 [2021-12-19 13:37:26,062 INFO L388 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 [2021-12-19 13:37:26,162 INFO L388 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 [2021-12-19 13:37:26,165 INFO L388 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 [2021-12-19 13:37:26,205 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843)))) is different from true [2021-12-19 13:37:26,214 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845)))) is different from true [2021-12-19 13:37:26,223 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848)))) is different from true [2021-12-19 13:37:26,273 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,283 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,315 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,332 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859)))) is different from true [2021-12-19 13:37:26,365 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,382 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868)))) is different from true [2021-12-19 13:37:26,431 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874)))) is different from true [2021-12-19 13:37:26,477 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880)))) is different from true [2021-12-19 13:37:26,548 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2021-12-19 13:37:26,557 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889))) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,566 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892)))) is different from true [2021-12-19 13:37:26,574 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893)))) is different from true [2021-12-19 13:37:26,640 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,670 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:37:26,700 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,710 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909)))) is different from true [2021-12-19 13:37:26,761 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916)))) is different from true [2021-12-19 13:37:26,793 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2021-12-19 13:37:26,823 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:37:26,832 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926)))) is different from true [2021-12-19 13:37:26,908 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:37:26,909 INFO L388 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 [2021-12-19 13:37:26,918 INFO L388 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 [2021-12-19 13:37:26,949 INFO L388 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 [2021-12-19 13:37:26,952 INFO L388 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 [2021-12-19 13:37:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2021-12-19 13:37:26,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:37:27,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |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~mem38#1.base| v_ArrVal_3022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:37:27,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:37:27,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330974910] [2021-12-19 13:37:27,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330974910] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:37:27,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2041318723] [2021-12-19 13:37:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:37:27,570 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:37:27,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:37:27,571 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) [2021-12-19 13:37:27,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-19 13:40:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:07,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-19 13:40:07,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:07,754 INFO L388 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 [2021-12-19 13:40:07,867 INFO L388 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 [2021-12-19 13:40:07,875 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:40:07,875 INFO L388 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 14 treesize of output 14 [2021-12-19 13:40:07,884 INFO L388 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 [2021-12-19 13:40:07,890 INFO L388 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 [2021-12-19 13:40:07,937 INFO L388 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 [2021-12-19 13:40:07,941 INFO L388 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 [2021-12-19 13:40:07,977 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3398))) (exists ((v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3399)))) is different from true [2021-12-19 13:40:07,987 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3400))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3401)))) is different from true [2021-12-19 13:40:07,997 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3403))) (exists ((v_ArrVal_3402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3402))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,008 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3405))) (exists ((v_ArrVal_3404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3404))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,041 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,051 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411))) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,061 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412)))) is different from true [2021-12-19 13:40:08,101 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417)))) is different from true [2021-12-19 13:40:08,112 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3418))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3419)))) is different from true [2021-12-19 13:40:08,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420)))) is different from true [2021-12-19 13:40:08,153 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3422))) (exists ((v_ArrVal_3423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3423))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,184 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427)))) is different from true [2021-12-19 13:40:08,195 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429)))) is different from true [2021-12-19 13:40:08,205 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431)))) is different from true [2021-12-19 13:40:08,238 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,292 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440)))) is different from true [2021-12-19 13:40:08,389 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,399 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453)))) is different from true [2021-12-19 13:40:08,410 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,420 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456)))) is different from true [2021-12-19 13:40:08,430 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3458))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3459)))) is different from true [2021-12-19 13:40:08,462 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,472 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465)))) is different from true [2021-12-19 13:40:08,482 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466))) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467)))) is different from true [2021-12-19 13:40:08,493 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3469))) (exists ((v_ArrVal_3468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3468))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,546 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475)))) is different from true [2021-12-19 13:40:08,556 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476)))) is different from true [2021-12-19 13:40:08,611 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482)))) is different from true [2021-12-19 13:40:08,622 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:08,656 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:08,656 INFO L388 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 [2021-12-19 13:40:08,660 INFO L388 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 [2021-12-19 13:40:08,695 INFO L388 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 [2021-12-19 13:40:08,699 INFO L388 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 [2021-12-19 13:40:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2021-12-19 13:40:08,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:09,243 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |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~mem38#1.base| v_ArrVal_3576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:40:09,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2041318723] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:09,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:40:09,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37] total 61 [2021-12-19 13:40:09,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539420456] [2021-12-19 13:40:09,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:40:09,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-19 13:40:09,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:40:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-19 13:40:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=134, Unknown=63, NotChecked=3960, Total=4290 [2021-12-19 13:40:09,250 INFO L87 Difference]: Start difference. First operand 1180 states and 1438 transitions. Second operand has 62 states, 60 states have (on average 2.4833333333333334) internal successors, (149), 62 states have internal predecessors, (149), 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) [2021-12-19 13:40:09,569 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843))) (exists ((v_ArrVal_3398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3398))) (exists ((v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3399)))) is different from true [2021-12-19 13:40:09,592 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_3402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3402))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_3403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3403))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:40:09,601 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411))) (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_3405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3405))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3418))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3419))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476))) (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452))) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_3404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3404))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:40:09,611 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867))) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3418))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3419))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476))) (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452))) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:40:09,622 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3469))) (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457))) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867))) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3422))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3418))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3419))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476))) (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452))) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860))) (exists ((v_ArrVal_3468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3468))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_ArrVal_3423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3423))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:40:09,646 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3469))) (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457))) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867))) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408))) (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3422))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3418))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3419))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475))) (exists ((v_ArrVal_3459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3459))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426))) (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476))) (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452))) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910))) (exists ((v_ArrVal_3458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3458))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860))) (exists ((v_ArrVal_3468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3468))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474))) (exists ((v_ArrVal_3423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3423))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2021-12-19 13:40:09,650 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-12-19 13:40:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:40:12,602 INFO L93 Difference]: Finished difference Result 1186 states and 1444 transitions. [2021-12-19 13:40:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 13:40:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 2.4833333333333334) internal successors, (149), 62 states have internal predecessors, (149), 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 117 [2021-12-19 13:40:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:40:12,607 INFO L225 Difference]: With dead ends: 1186 [2021-12-19 13:40:12,607 INFO L226 Difference]: Without dead ends: 1186 [2021-12-19 13:40:12,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 139 SyntacticMatches, 38 SemanticMatches, 77 ConstructedPredicates, 62 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=259, Unknown=76, NotChecked=5642, Total=6162 [2021-12-19 13:40:12,608 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 795 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 54954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52681 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:40:12,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [799 Valid, 2052 Invalid, 54954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2263 Invalid, 0 Unknown, 52681 Unchecked, 3.0s Time] [2021-12-19 13:40:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-12-19 13:40:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1179. [2021-12-19 13:40:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 790 states have (on average 1.7620253164556963) internal successors, (1392), 1167 states have internal predecessors, (1392), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:40:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1437 transitions. [2021-12-19 13:40:12,620 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1437 transitions. Word has length 117 [2021-12-19 13:40:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:40:12,620 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1437 transitions. [2021-12-19 13:40:12,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 2.4833333333333334) internal successors, (149), 62 states have internal predecessors, (149), 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) [2021-12-19 13:40:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1437 transitions. [2021-12-19 13:40:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-19 13:40:12,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:40:12,622 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:40:12,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-12-19 13:40:12,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-19 13:40:13,043 WARN L452 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 [2021-12-19 13:40:13,044 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:40:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:40:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2089427400, now seen corresponding path program 1 times [2021-12-19 13:40:13,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:40:13,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159685126] [2021-12-19 13:40:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:13,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:40:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:40:13,045 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) [2021-12-19 13:40:13,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-19 13:40:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:13,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-19 13:40:13,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:13,864 INFO L388 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 [2021-12-19 13:40:13,967 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:40:13,967 INFO L388 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 20 treesize of output 27 [2021-12-19 13:40:13,984 INFO L388 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 [2021-12-19 13:40:14,064 INFO L388 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 [2021-12-19 13:40:15,484 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:15,484 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:15,576 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:15,576 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:15,594 INFO L388 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 34 treesize of output 16 [2021-12-19 13:40:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-19 13:40:15,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:15,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4001) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:40:15,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:40:15,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4001)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:40:15,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:40:15,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159685126] [2021-12-19 13:40:15,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159685126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025539230] [2021-12-19 13:40:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:15,825 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:40:15,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:40:15,826 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) [2021-12-19 13:40:15,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2021-12-19 13:40:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:19,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-19 13:40:20,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:20,023 INFO L388 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 [2021-12-19 13:40:20,134 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:40:20,134 INFO L388 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 20 treesize of output 27 [2021-12-19 13:40:20,147 INFO L388 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 [2021-12-19 13:40:20,187 INFO L388 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 [2021-12-19 13:40:20,546 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| v_arrayElimCell_42)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_42)) (_ bv1 1))))) (exists ((v_ArrVal_4436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4436)))) is different from true [2021-12-19 13:40:20,655 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| v_arrayElimCell_42)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_42)) (_ bv1 1))))) (exists ((v_ArrVal_4440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4440)))) is different from true [2021-12-19 13:40:21,582 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:21,583 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:21,628 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:21,629 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:21,646 INFO L388 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 34 treesize of output 16 [2021-12-19 13:40:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-12-19 13:40:21,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:21,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:40:21,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:40:21,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2025539230] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:21,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:40:21,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2021-12-19 13:40:21,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242764050] [2021-12-19 13:40:21,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:40:21,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-19 13:40:21,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:40:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-19 13:40:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=118, Unknown=18, NotChecked=196, Total=380 [2021-12-19 13:40:21,862 INFO L87 Difference]: Start difference. First operand 1179 states and 1437 transitions. Second operand has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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) [2021-12-19 13:40:22,039 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| v_arrayElimCell_42)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_42)) (_ bv1 1))))) (exists ((v_ArrVal_4440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4440))) (exists ((v_ArrVal_4436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4436))) (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957)))) is different from true [2021-12-19 13:40:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:40:23,564 INFO L93 Difference]: Finished difference Result 1185 states and 1443 transitions. [2021-12-19 13:40:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 13:40:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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 [2021-12-19 13:40:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:40:23,567 INFO L225 Difference]: With dead ends: 1185 [2021-12-19 13:40:23,567 INFO L226 Difference]: Without dead ends: 1185 [2021-12-19 13:40:23,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 146 SyntacticMatches, 88 SemanticMatches, 21 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=158, Unknown=21, NotChecked=264, Total=506 [2021-12-19 13:40:23,568 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 794 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 5148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3819 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:40:23,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [798 Valid, 2585 Invalid, 5148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1320 Invalid, 0 Unknown, 3819 Unchecked, 1.6s Time] [2021-12-19 13:40:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2021-12-19 13:40:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1178. [2021-12-19 13:40:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 790 states have (on average 1.7607594936708861) internal successors, (1391), 1166 states have internal predecessors, (1391), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:40:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1436 transitions. [2021-12-19 13:40:23,580 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1436 transitions. Word has length 120 [2021-12-19 13:40:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:40:23,580 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 1436 transitions. [2021-12-19 13:40:23,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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) [2021-12-19 13:40:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1436 transitions. [2021-12-19 13:40:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-19 13:40:23,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:40:23,581 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:40:23,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2021-12-19 13:40:23,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-19 13:40:23,995 WARN L452 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 [2021-12-19 13:40:23,995 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:40:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:40:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2089427399, now seen corresponding path program 1 times [2021-12-19 13:40:23,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:40:23,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577644575] [2021-12-19 13:40:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:23,996 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:40:23,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:40:23,997 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) [2021-12-19 13:40:23,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-19 13:40:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:24,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-19 13:40:24,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:24,894 INFO L388 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 [2021-12-19 13:40:24,986 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:40:24,986 INFO L388 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 14 treesize of output 14 [2021-12-19 13:40:24,990 INFO L388 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 [2021-12-19 13:40:25,024 INFO L388 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 [2021-12-19 13:40:25,032 INFO L388 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 [2021-12-19 13:40:25,102 INFO L388 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 [2021-12-19 13:40:25,105 INFO L388 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 [2021-12-19 13:40:25,139 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4899))) (exists ((v_ArrVal_4900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4900)))) is different from true [2021-12-19 13:40:25,147 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4901))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902)))) is different from true [2021-12-19 13:40:25,201 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:25,210 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907)))) is different from true [2021-12-19 13:40:25,219 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910)))) is different from true [2021-12-19 13:40:25,229 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912)))) is different from true [2021-12-19 13:40:25,238 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4914))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913)))) is different from true [2021-12-19 13:40:25,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_4915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4915)))) is different from true [2021-12-19 13:40:25,257 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917)))) is different from true [2021-12-19 13:40:25,266 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919)))) is different from true [2021-12-19 13:40:25,275 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922)))) is different from true [2021-12-19 13:40:25,283 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923))) (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_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:25,292 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925)))) is different from true [2021-12-19 13:40:25,322 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (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)))) is different from true [2021-12-19 13:40:25,420 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939)))) is different from true [2021-12-19 13:40:25,449 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:25,479 WARN L860 $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)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (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 [2021-12-19 13:40:25,489 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950)))) is different from true [2021-12-19 13:40:25,498 WARN L860 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951)))) is different from true [2021-12-19 13:40:25,587 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:25,614 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966)))) is different from true [2021-12-19 13:40:25,734 WARN L860 $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_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:25,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:25,834 INFO L388 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 [2021-12-19 13:40:25,837 INFO L388 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 [2021-12-19 13:40:25,905 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:25,906 INFO L388 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 [2021-12-19 13:40:25,909 INFO L388 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 [2021-12-19 13:40:25,929 INFO L388 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 [2021-12-19 13:40:25,937 INFO L388 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 [2021-12-19 13:40:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2021-12-19 13:40:25,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:26,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:40:26,119 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:40:26,620 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5079)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5080) .cse0 v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5080) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 13:40:26,624 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:40:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577644575] [2021-12-19 13:40:26,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577644575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [127441306] [2021-12-19 13:40:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:26,625 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:40:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:40:26,626 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) [2021-12-19 13:40:26,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-12-19 13:40:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:30,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-19 13:40:30,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:31,004 INFO L388 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 [2021-12-19 13:40:31,122 INFO L388 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 [2021-12-19 13:40:31,130 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:40:31,130 INFO L388 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 14 treesize of output 14 [2021-12-19 13:40:31,141 INFO L388 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 [2021-12-19 13:40:31,149 INFO L388 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 [2021-12-19 13:40:31,201 INFO L388 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 [2021-12-19 13:40:31,205 INFO L388 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 [2021-12-19 13:40:31,249 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5462))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5463)))) is different from true [2021-12-19 13:40:31,258 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5465))) (exists ((v_ArrVal_5464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5464)))) is different from true [2021-12-19 13:40:31,270 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5466))) (exists ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5467)))) is different from true [2021-12-19 13:40:31,280 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5468))) (exists ((v_ArrVal_5469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5469)))) is different from true [2021-12-19 13:40:31,290 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5470))) (exists ((v_ArrVal_5471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5471))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:31,300 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5472))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5473)))) is different from true [2021-12-19 13:40:31,334 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477)))) is different from true [2021-12-19 13:40:31,344 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478)))) is different from true [2021-12-19 13:40:31,354 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:31,364 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5483))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5482)))) is different from true [2021-12-19 13:40:31,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5484))) (exists ((v_ArrVal_5485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5485))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:31,383 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5486))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487)))) is different from true [2021-12-19 13:40:31,394 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488))) (exists ((v_ArrVal_5489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5489)))) is different from true [2021-12-19 13:40:31,478 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497)))) is different from true [2021-12-19 13:40:31,508 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:31,517 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2021-12-19 13:40:31,546 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507)))) is different from true [2021-12-19 13:40:31,556 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509)))) is different from true [2021-12-19 13:40:31,565 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511))) (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510)))) is different from true [2021-12-19 13:40:31,579 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5512))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5513)))) is different from true [2021-12-19 13:40:31,618 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517)))) is different from true [2021-12-19 13:40:31,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519)))) is different from true [2021-12-19 13:40:31,638 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521)))) is different from true [2021-12-19 13:40:31,648 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523)))) is different from true [2021-12-19 13:40:31,657 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5524)))) is different from true [2021-12-19 13:40:31,666 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5526))) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527)))) is different from true [2021-12-19 13:40:31,676 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528)))) is different from true [2021-12-19 13:40:31,743 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534)))) is different from true [2021-12-19 13:40:31,754 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537)))) is different from true [2021-12-19 13:40:31,785 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541)))) is different from true [2021-12-19 13:40:31,799 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2021-12-19 13:40:31,810 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544)))) is different from true [2021-12-19 13:40:31,894 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:31,894 INFO L388 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 [2021-12-19 13:40:31,898 INFO L388 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 [2021-12-19 13:40:31,948 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:31,949 INFO L388 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 [2021-12-19 13:40:31,953 INFO L388 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 [2021-12-19 13:40:31,982 INFO L388 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 [2021-12-19 13:40:31,985 INFO L388 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 [2021-12-19 13:40:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2021-12-19 13:40:31,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:32,040 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:40:32,068 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:40:32,560 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5643) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5642)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5643) .cse2 v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:40:32,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [127441306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:32,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:40:32,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41] total 63 [2021-12-19 13:40:32,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695833060] [2021-12-19 13:40:32,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:40:32,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-19 13:40:32,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:40:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-19 13:40:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=156, Unknown=69, NotChecked=4740, Total=5112 [2021-12-19 13:40:32,570 INFO L87 Difference]: Start difference. First operand 1178 states and 1436 transitions. Second operand has 64 states, 62 states have (on average 2.3548387096774195) internal successors, (146), 64 states have internal predecessors, (146), 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) [2021-12-19 13:40:32,873 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5462))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4899))) (exists ((v_ArrVal_5463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5463))) (exists ((v_ArrVal_4900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4900)))) is different from true [2021-12-19 13:40:32,875 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5465))) (exists ((v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4901))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_5464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5464)))) is different from true [2021-12-19 13:40:32,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (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))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5468))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (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_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (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_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5469))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:32,891 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (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))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (exists ((v_ArrVal_5470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5470))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (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_ArrVal_5471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5471))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (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_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:32,897 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950))) (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (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))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (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_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_5472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5472))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909))) (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_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (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_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_5473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5473))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:32,904 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950))) (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (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))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_5483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5483))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536))) (exists ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5513))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523))) (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_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_5512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5512))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909))) (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_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (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_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_5482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5482))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:32,912 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940))) (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950))) (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_ArrVal_5485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5485))) (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (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))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905))) (exists ((v_ArrVal_5483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5483))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_ArrVal_5484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5484))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536))) (exists ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5513))) (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523))) (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_4914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4914))) (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962))) (exists ((v_ArrVal_5512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5512))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5524))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909))) (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_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979))) (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_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500))) (exists ((v_ArrVal_5482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5482))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501)))) is different from true [2021-12-19 13:40:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:40:35,733 INFO L93 Difference]: Finished difference Result 1189 states and 1452 transitions. [2021-12-19 13:40:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 13:40:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 2.3548387096774195) internal successors, (146), 64 states have internal predecessors, (146), 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 [2021-12-19 13:40:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:40:35,735 INFO L225 Difference]: With dead ends: 1189 [2021-12-19 13:40:35,736 INFO L226 Difference]: Without dead ends: 1189 [2021-12-19 13:40:35,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 146 SyntacticMatches, 38 SemanticMatches, 84 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=321, Unknown=83, NotChecked=6700, Total=7310 [2021-12-19 13:40:35,737 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 793 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 56389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54116 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:40:35,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 2059 Invalid, 56389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2261 Invalid, 0 Unknown, 54116 Unchecked, 2.8s Time] [2021-12-19 13:40:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2021-12-19 13:40:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1177. [2021-12-19 13:40:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 790 states have (on average 1.759493670886076) internal successors, (1390), 1165 states have internal predecessors, (1390), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:40:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1435 transitions. [2021-12-19 13:40:35,748 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1435 transitions. Word has length 120 [2021-12-19 13:40:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:40:35,748 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1435 transitions. [2021-12-19 13:40:35,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 2.3548387096774195) internal successors, (146), 64 states have internal predecessors, (146), 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) [2021-12-19 13:40:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1435 transitions. [2021-12-19 13:40:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-19 13:40:35,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:40:35,749 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-19 13:40:35,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-12-19 13:40:35,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-19 13:40:36,163 WARN L452 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 [2021-12-19 13:40:36,164 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:40:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:40:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 829736819, now seen corresponding path program 1 times [2021-12-19 13:40:36,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:40:36,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484782609] [2021-12-19 13:40:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:36,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:40:36,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:40:36,166 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) [2021-12-19 13:40:36,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-19 13:40:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:40:37,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 13:40:37,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:40:37,160 INFO L388 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 [2021-12-19 13:40:37,257 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:40:37,257 INFO L388 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 20 treesize of output 27 [2021-12-19 13:40:37,274 INFO L388 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 [2021-12-19 13:40:37,342 INFO L388 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 [2021-12-19 13:40:38,663 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:38,663 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:38,737 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:38,737 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:38,796 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:40:38,796 INFO L388 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 37 treesize of output 38 [2021-12-19 13:40:38,812 INFO L388 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 34 treesize of output 16 [2021-12-19 13:40:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-19 13:40:38,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:40:38,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6083) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:40:38,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6083) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:40:38,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:40:38,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:40:39,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6129))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:40:39,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:40:39,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484782609] [2021-12-19 13:40:39,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484782609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:40:39,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120496616] [2021-12-19 13:40:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:40:39,055 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:40:39,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:40:39,056 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) [2021-12-19 13:40:39,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2021-12-19 13:41:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:41:01,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:41:01,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:41:01,182 INFO L388 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 [2021-12-19 13:41:01,286 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:41:01,286 INFO L388 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 20 treesize of output 27 [2021-12-19 13:41:01,297 INFO L388 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 [2021-12-19 13:41:01,340 INFO L388 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 [2021-12-19 13:41:01,835 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_74)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| v_arrayElimCell_74)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|))) (_ bv1 1))))) (exists ((v_ArrVal_6540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6540)))) is different from true [2021-12-19 13:41:02,642 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:02,642 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:02,700 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:02,700 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:02,736 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:02,736 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:02,754 INFO L388 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 34 treesize of output 16 [2021-12-19 13:41:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:41:02,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:41:02,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6570) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:41:02,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6570) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:41:02,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6569))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6570)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:02,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6569))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6570)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:02,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6616))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6569)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6570)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:02,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2120496616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:41:02,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:41:02,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2021-12-19 13:41:02,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425754411] [2021-12-19 13:41:02,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:41:02,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-19 13:41:02,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:41:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-19 13:41:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=121, Unknown=21, NotChecked=352, Total=552 [2021-12-19 13:41:02,971 INFO L87 Difference]: Start difference. First operand 1177 states and 1435 transitions. Second operand has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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) [2021-12-19 13:41:03,236 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_74)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| v_arrayElimCell_74)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|))) (_ bv1 1))))) (exists ((v_ArrVal_6540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6540)))) is different from true [2021-12-19 13:41:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:41:05,824 INFO L93 Difference]: Finished difference Result 1183 states and 1441 transitions. [2021-12-19 13:41:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 13:41:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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 123 [2021-12-19 13:41:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:41:05,827 INFO L225 Difference]: With dead ends: 1183 [2021-12-19 13:41:05,827 INFO L226 Difference]: Without dead ends: 1183 [2021-12-19 13:41:05,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 153 SyntacticMatches, 89 SemanticMatches, 25 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=161, Unknown=24, NotChecked=444, Total=702 [2021-12-19 13:41:05,830 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 790 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2853 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:41:05,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 3697 Invalid, 5088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2225 Invalid, 0 Unknown, 2853 Unchecked, 2.8s Time] [2021-12-19 13:41:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-12-19 13:41:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1176. [2021-12-19 13:41:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 790 states have (on average 1.7582278481012659) internal successors, (1389), 1164 states have internal predecessors, (1389), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:41:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1434 transitions. [2021-12-19 13:41:05,841 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1434 transitions. Word has length 123 [2021-12-19 13:41:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:41:05,842 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1434 transitions. [2021-12-19 13:41:05,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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) [2021-12-19 13:41:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1434 transitions. [2021-12-19 13:41:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-19 13:41:05,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:41:05,843 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-19 13:41:05,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-19 13:41:06,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2021-12-19 13:41:06,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:41:06,255 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:41:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:41:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 829736820, now seen corresponding path program 1 times [2021-12-19 13:41:06,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:41:06,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598596724] [2021-12-19 13:41:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:41:06,257 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:41:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:41:06,262 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:41:06,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-19 13:41:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:41:07,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-19 13:41:07,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:41:07,443 INFO L388 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 [2021-12-19 13:41:07,551 INFO L388 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 [2021-12-19 13:41:07,560 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:41:07,560 INFO L388 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 14 treesize of output 14 [2021-12-19 13:41:07,576 INFO L388 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 [2021-12-19 13:41:07,583 INFO L388 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 [2021-12-19 13:41:07,663 INFO L388 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 [2021-12-19 13:41:07,666 INFO L388 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 [2021-12-19 13:41:07,704 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013))) (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014)))) is different from true [2021-12-19 13:41:07,761 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019)))) is different from true [2021-12-19 13:41:07,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022)))) is different from true [2021-12-19 13:41:07,818 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026)))) is different from true [2021-12-19 13:41:07,847 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:07,876 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034)))) is different from true [2021-12-19 13:41:07,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:07,936 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042)))) is different from true [2021-12-19 13:41:07,965 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:07,974 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048)))) is different from true [2021-12-19 13:41:08,070 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057)))) is different from true [2021-12-19 13:41:08,079 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:08,130 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066)))) is different from true [2021-12-19 13:41:08,139 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067)))) is different from true [2021-12-19 13:41:08,168 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071)))) is different from true [2021-12-19 13:41:08,181 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073)))) is different from true [2021-12-19 13:41:08,234 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079)))) is different from true [2021-12-19 13:41:08,243 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:08,273 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085)))) is different from true [2021-12-19 13:41:08,303 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089)))) is different from true [2021-12-19 13:41:08,312 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091)))) is different from true [2021-12-19 13:41:08,321 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093)))) is different from true [2021-12-19 13:41:08,351 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098)))) is different from true [2021-12-19 13:41:08,360 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:08,406 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:08,406 INFO L388 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 [2021-12-19 13:41:08,410 INFO L388 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 [2021-12-19 13:41:08,481 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:08,481 INFO L388 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 [2021-12-19 13:41:08,487 INFO L388 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 [2021-12-19 13:41:08,550 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:08,550 INFO L388 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 [2021-12-19 13:41:08,554 INFO L388 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 [2021-12-19 13:41:08,575 INFO L388 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 [2021-12-19 13:41:08,578 INFO L388 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 [2021-12-19 13:41:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2021-12-19 13:41:08,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:41:08,713 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:41:08,739 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:41:08,780 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7101)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7102) .cse0 v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7102) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 13:41:08,825 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7101))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7102) .cse1 v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_7102) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_7101) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_7103)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 13:41:09,400 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7195))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7196) .cse1 v_ArrVal_7102) (select (select (store .cse2 .cse1 v_ArrVal_7101) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7103))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7195)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7101))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7196) .cse4 v_ArrVal_7102) .cse5 v_ArrVal_7103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:41:09,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:41:09,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598596724] [2021-12-19 13:41:09,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598596724] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:41:09,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929077848] [2021-12-19 13:41:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:41:09,407 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:41:09,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:41:09,408 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:41:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-12-19 13:41:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:41:30,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 13:41:30,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:41:30,650 INFO L388 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 [2021-12-19 13:41:30,745 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:41:30,745 INFO L388 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 14 treesize of output 14 [2021-12-19 13:41:30,750 INFO L388 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 [2021-12-19 13:41:30,758 INFO L388 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 [2021-12-19 13:41:30,764 INFO L388 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 [2021-12-19 13:41:30,813 INFO L388 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 [2021-12-19 13:41:30,816 INFO L388 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 [2021-12-19 13:41:30,871 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:30,881 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598)))) is different from true [2021-12-19 13:41:30,890 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7601))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7600)))) is different from true [2021-12-19 13:41:30,973 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608)))) is different from true [2021-12-19 13:41:30,982 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611)))) is different from true [2021-12-19 13:41:30,990 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7612))) (exists ((v_ArrVal_7613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7613)))) is different from true [2021-12-19 13:41:31,017 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617)))) is different from true [2021-12-19 13:41:31,065 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623)))) is different from true [2021-12-19 13:41:31,073 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624)))) is different from true [2021-12-19 13:41:31,082 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626)))) is different from true [2021-12-19 13:41:31,090 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7628))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7629)))) is different from true [2021-12-19 13:41:31,117 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632)))) is different from true [2021-12-19 13:41:31,126 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634)))) is different from true [2021-12-19 13:41:31,134 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637)))) is different from true [2021-12-19 13:41:31,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7638))) (exists ((v_ArrVal_7639 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7639)))) is different from true [2021-12-19 13:41:31,150 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7640))) (exists ((v_ArrVal_7641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7641))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:31,159 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7643 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7643))) (exists ((v_ArrVal_7642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7642))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:31,194 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646)))) is different from true [2021-12-19 13:41:31,202 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648)))) is different from true [2021-12-19 13:41:31,230 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653)))) is different from true [2021-12-19 13:41:31,293 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660)))) is different from true [2021-12-19 13:41:31,301 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:31,312 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32)))) is different from true [2021-12-19 13:41:31,321 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7666))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7667)))) is different from true [2021-12-19 13:41:31,384 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675)))) is different from true [2021-12-19 13:41:31,411 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678)))) is different from true [2021-12-19 13:41:31,471 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:31,472 INFO L388 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 [2021-12-19 13:41:31,476 INFO L388 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 [2021-12-19 13:41:31,529 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:31,530 INFO L388 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 [2021-12-19 13:41:31,534 INFO L388 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 [2021-12-19 13:41:31,574 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:31,574 INFO L388 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 [2021-12-19 13:41:31,578 INFO L388 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 [2021-12-19 13:41:31,601 INFO L388 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 [2021-12-19 13:41:31,604 INFO L388 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 [2021-12-19 13:41:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2021-12-19 13:41:31,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:41:31,674 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7684) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-19 13:41:31,720 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7684) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:41:31,764 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7682) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7683) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7683)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7682) .cse2 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7684) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:41:31,925 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7683))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7682) .cse1 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7684) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_7682) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_7683) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_7685)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 13:41:32,544 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7776)) (.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7683))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7777) .cse0 v_ArrVal_7682) .cse1 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7684) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7776))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7777) .cse6 v_ArrVal_7682) (select (select (store .cse7 .cse6 v_ArrVal_7683) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_7685))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32)))))) is different from false [2021-12-19 13:41:32,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929077848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:41:32,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:41:32,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 60 [2021-12-19 13:41:32,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208791998] [2021-12-19 13:41:32,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:41:32,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-19 13:41:32,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:41:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-19 13:41:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=175, Unknown=70, NotChecked=4860, Total=5256 [2021-12-19 13:41:32,556 INFO L87 Difference]: Start difference. First operand 1176 states and 1434 transitions. Second operand has 61 states, 59 states have (on average 2.610169491525424) internal successors, (154), 61 states have internal predecessors, (154), 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) [2021-12-19 13:41:33,043 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014)))) is different from true [2021-12-19 13:41:33,050 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034)))) is different from true [2021-12-19 13:41:33,059 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034)))) is different from true [2021-12-19 13:41:33,075 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7613))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7600))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7601))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7612))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034)))) is different from true [2021-12-19 13:41:33,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7613))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7628))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627))) (exists ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7638))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598))) (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7600))) (exists ((v_ArrVal_7639 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7639))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7601))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7629))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022))) (exists ((v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7666))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_ArrVal_7612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7612))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034))) (exists ((v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7667)))) is different from true [2021-12-19 13:41:33,099 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7613))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7628))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_ArrVal_7641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7641))) (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7638))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7640))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598))) (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7600))) (exists ((v_ArrVal_7639 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7639))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7601))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7629))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022))) (exists ((v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7666))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_ArrVal_7612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7612))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034))) (exists ((v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7667)))) is different from true [2021-12-19 13:41:33,109 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7596))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085))) (exists ((v_ArrVal_7613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7613))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086))) (exists ((v_ArrVal_7610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7610))) (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665))) (exists ((v_ArrVal_7643 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7643))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646))) (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_ArrVal_7608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7608))) (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662))) (exists ((v_ArrVal_7642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7642))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647))) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092))) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675))) (exists ((v_ArrVal_7065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7065))) (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089))) (exists ((v_ArrVal_7628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7628))) (exists ((v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7597))) (exists ((v_ArrVal_7029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7029))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7611))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021))) (exists ((v_ArrVal_7030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7030))) (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_88) (_ bv44 32))) (exists ((v_ArrVal_7033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7033))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016))) (exists ((v_ArrVal_7057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7057))) (exists ((v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7036))) (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_ArrVal_7047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7047))) (exists ((v_ArrVal_7641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7641))) (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7638))) (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660))) (exists ((v_ArrVal_7066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7066))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678))) (exists ((v_ArrVal_7048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7048))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081))) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046))) (exists ((v_ArrVal_7640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7640))) (exists ((v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7598))) (exists ((v_ArrVal_7649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7649))) (exists ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7600))) (exists ((v_ArrVal_7639 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7639))) (exists ((v_ArrVal_7026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7026))) (exists ((v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7601))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059))) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045))) (exists ((v_ArrVal_7609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7609))) (exists ((v_ArrVal_7629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7629))) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100))) (exists ((v_ArrVal_7058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7058))) (exists ((v_ArrVal_7025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7025))) (exists ((v_ArrVal_7616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7616))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7599))) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624))) (exists ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7022))) (exists ((v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7666))) (exists ((v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7035))) (exists ((v_ArrVal_7612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7612))) (exists ((v_ArrVal_7034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7034))) (exists ((v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7667)))) is different from true [2021-12-19 13:41:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:41:38,728 INFO L93 Difference]: Finished difference Result 1182 states and 1440 transitions. [2021-12-19 13:41:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 13:41:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 2.610169491525424) internal successors, (154), 61 states have internal predecessors, (154), 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 123 [2021-12-19 13:41:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:41:38,730 INFO L225 Difference]: With dead ends: 1182 [2021-12-19 13:41:38,730 INFO L226 Difference]: Without dead ends: 1182 [2021-12-19 13:41:38,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 153 SyntacticMatches, 41 SemanticMatches, 86 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=386, Unknown=85, NotChecked=6968, Total=7656 [2021-12-19 13:41:38,732 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 791 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 4054 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 53817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49749 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:41:38,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 3111 Invalid, 53817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4054 Invalid, 0 Unknown, 49749 Unchecked, 5.8s Time] [2021-12-19 13:41:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-12-19 13:41:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1175. [2021-12-19 13:41:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 790 states have (on average 1.7569620253164557) internal successors, (1388), 1163 states have internal predecessors, (1388), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:41:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1433 transitions. [2021-12-19 13:41:38,742 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1433 transitions. Word has length 123 [2021-12-19 13:41:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:41:38,742 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1433 transitions. [2021-12-19 13:41:38,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 2.610169491525424) internal successors, (154), 61 states have internal predecessors, (154), 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) [2021-12-19 13:41:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1433 transitions. [2021-12-19 13:41:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-19 13:41:38,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:41:38,743 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 13:41:38,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-12-19 13:41:38,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2021-12-19 13:41:39,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:41:39,162 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:41:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:41:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1153182591, now seen corresponding path program 1 times [2021-12-19 13:41:39,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:41:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286712027] [2021-12-19 13:41:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:41:39,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:41:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:41:39,164 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:41:39,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-19 13:41:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:41:40,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-19 13:41:40,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:41:40,591 INFO L388 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 [2021-12-19 13:41:40,695 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:41:40,696 INFO L388 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 20 treesize of output 27 [2021-12-19 13:41:40,712 INFO L388 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 [2021-12-19 13:41:40,784 INFO L388 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 [2021-12-19 13:41:40,936 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8189)))) is different from true [2021-12-19 13:41:41,041 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8193)))) is different from true [2021-12-19 13:41:41,299 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8202)))) is different from true [2021-12-19 13:41:42,227 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:42,228 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:42,313 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:42,314 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:42,377 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:42,378 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:42,440 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:41:42,440 INFO L388 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 37 treesize of output 38 [2021-12-19 13:41:42,459 INFO L388 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 34 treesize of output 16 [2021-12-19 13:41:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2021-12-19 13:41:42,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:41:42,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8233) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8232))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8231))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8231))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8279))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8231)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:41:42,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:41:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286712027] [2021-12-19 13:41:42,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286712027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:41:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [351316296] [2021-12-19 13:41:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:41:42,788 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:41:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:41:42,789 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:41:42,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-12-19 13:42:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:08,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:42:08,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:08,926 INFO L388 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 [2021-12-19 13:42:09,023 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:42:09,023 INFO L388 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 20 treesize of output 27 [2021-12-19 13:42:09,034 INFO L388 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 [2021-12-19 13:42:09,075 INFO L388 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 [2021-12-19 13:42:09,229 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8693)))) is different from true [2021-12-19 13:42:09,631 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8708)))) is different from true [2021-12-19 13:42:09,726 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8712)))) is different from true [2021-12-19 13:42:09,742 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8713)))) is different from true [2021-12-19 13:42:09,784 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8715)))) is different from true [2021-12-19 13:42:09,836 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_112)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| v_arrayElimCell_112)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (_ bv1 1))))) (exists ((v_ArrVal_8717 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8717)))) is different from true [2021-12-19 13:42:10,322 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:10,322 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:10,379 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:10,379 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:10,426 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:10,427 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:10,462 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:10,463 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:10,480 INFO L388 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 34 treesize of output 16 [2021-12-19 13:42:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2021-12-19 13:42:10,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:10,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8736) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8735))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8782))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8734)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:10,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [351316296] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:10,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:42:10,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 20 [2021-12-19 13:42:10,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172094] [2021-12-19 13:42:10,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:42:10,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-19 13:42:10,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:42:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-19 13:42:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=34, NotChecked=1058, Total=1332 [2021-12-19 13:42:10,719 INFO L87 Difference]: Start difference. First operand 1175 states and 1433 transitions. Second operand has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 21 states have internal predecessors, (99), 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) [2021-12-19 13:42:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:42:12,886 INFO L93 Difference]: Finished difference Result 1181 states and 1439 transitions. [2021-12-19 13:42:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 13:42:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 21 states have internal predecessors, (99), 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 126 [2021-12-19 13:42:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:42:12,888 INFO L225 Difference]: With dead ends: 1181 [2021-12-19 13:42:12,888 INFO L226 Difference]: Without dead ends: 1181 [2021-12-19 13:42:12,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 160 SyntacticMatches, 82 SemanticMatches, 37 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=196, Unknown=36, NotChecked=1150, Total=1482 [2021-12-19 13:42:12,889 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 787 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 12344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10537 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:42:12,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 3182 Invalid, 12344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1796 Invalid, 0 Unknown, 10537 Unchecked, 2.1s Time] [2021-12-19 13:42:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-12-19 13:42:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1174. [2021-12-19 13:42:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 790 states have (on average 1.7556962025316456) internal successors, (1387), 1162 states have internal predecessors, (1387), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:42:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1432 transitions. [2021-12-19 13:42:12,897 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1432 transitions. Word has length 126 [2021-12-19 13:42:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:42:12,898 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1432 transitions. [2021-12-19 13:42:12,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 21 states have internal predecessors, (99), 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) [2021-12-19 13:42:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1432 transitions. [2021-12-19 13:42:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-19 13:42:12,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:42:12,899 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 13:42:12,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-19 13:42:13,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2021-12-19 13:42:13,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:13,315 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:42:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:42:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1153182592, now seen corresponding path program 1 times [2021-12-19 13:42:13,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:42:13,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140019825] [2021-12-19 13:42:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:13,316 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:42:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:42:13,317 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:42:13,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-19 13:42:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:14,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 13:42:14,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:14,660 INFO L388 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 [2021-12-19 13:42:14,752 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:42:14,753 INFO L388 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 14 treesize of output 14 [2021-12-19 13:42:14,756 INFO L388 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 [2021-12-19 13:42:14,770 INFO L388 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 [2021-12-19 13:42:14,776 INFO L388 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 [2021-12-19 13:42:14,844 INFO L388 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 [2021-12-19 13:42:14,851 INFO L388 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 [2021-12-19 13:42:14,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9194))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9195)))) is different from true [2021-12-19 13:42:14,894 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9197))) (exists ((v_ArrVal_9196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9196))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:14,902 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9198))) (exists ((v_ArrVal_9199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9199))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:14,990 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,011 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,057 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,161 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229)))) is different from true [2021-12-19 13:42:15,188 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233)))) is different from true [2021-12-19 13:42:15,252 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,317 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249)))) is different from true [2021-12-19 13:42:15,419 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261)))) is different from true [2021-12-19 13:42:15,445 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,472 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268)))) is different from true [2021-12-19 13:42:15,499 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:15,507 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275)))) is different from true [2021-12-19 13:42:15,602 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:15,602 INFO L388 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 [2021-12-19 13:42:15,606 INFO L388 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 [2021-12-19 13:42:15,673 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:15,674 INFO L388 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 [2021-12-19 13:42:15,679 INFO L388 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 [2021-12-19 13:42:15,739 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:15,739 INFO L388 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 [2021-12-19 13:42:15,742 INFO L388 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 [2021-12-19 13:42:15,804 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:15,804 INFO L388 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 [2021-12-19 13:42:15,809 INFO L388 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 [2021-12-19 13:42:15,828 INFO L388 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 [2021-12-19 13:42:15,832 INFO L388 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 [2021-12-19 13:42:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 555 not checked. [2021-12-19 13:42:15,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:15,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:42:16,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:42:16,044 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9285) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9284)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9285) .cse2 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:42:16,079 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9285) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_9284))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_9285) .cse4 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 13:42:16,139 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9282))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9283) .cse1 v_ArrVal_9285) (select (select (store .cse2 .cse1 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9287))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9282)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_9284))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9283) .cse4 v_ArrVal_9285) .cse5 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:42:16,192 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9282))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9283) .cse2 v_ArrVal_9285) (select (select (store .cse3 .cse2 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9287)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_9282))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_9284))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_9283) .cse6 v_ArrVal_9285) .cse7 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-19 13:42:16,701 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9378 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9379)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9282))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9284))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9378) .cse0 v_ArrVal_9283) .cse1 v_ArrVal_9285) .cse2 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9378 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9379))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_9282))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9378) .cse8 v_ArrVal_9283) .cse9 v_ArrVal_9285) (select (select (store .cse10 .cse9 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11) v_ArrVal_9287))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11)))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32)))))) is different from false [2021-12-19 13:42:16,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:42:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140019825] [2021-12-19 13:42:16,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140019825] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1476707902] [2021-12-19 13:42:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:16,711 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:42:16,712 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:42:16,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2021-12-19 13:42:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:43,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 13:42:43,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:43,203 INFO L388 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 [2021-12-19 13:42:43,295 INFO L388 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 [2021-12-19 13:42:43,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:42:43,303 INFO L388 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 14 treesize of output 14 [2021-12-19 13:42:43,319 INFO L388 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 [2021-12-19 13:42:43,324 INFO L388 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 [2021-12-19 13:42:43,366 INFO L388 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 [2021-12-19 13:42:43,369 INFO L388 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 [2021-12-19 13:42:43,402 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9791))) (exists ((v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9792))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,424 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9794))) (exists ((v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9793))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,432 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9796))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9795)))) is different from true [2021-12-19 13:42:43,440 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9797))) (exists ((v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9798))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,448 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9799))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9800)))) is different from true [2021-12-19 13:42:43,457 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9801))) (exists ((v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9802))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,486 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,496 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807)))) is different from true [2021-12-19 13:42:43,505 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9810))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9809)))) is different from true [2021-12-19 13:42:43,514 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9811))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9812)))) is different from true [2021-12-19 13:42:43,523 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9814))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9813)))) is different from true [2021-12-19 13:42:43,533 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9816))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9815)))) is different from true [2021-12-19 13:42:43,851 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,860 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,897 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854)))) is different from true [2021-12-19 13:42:43,928 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858)))) is different from true [2021-12-19 13:42:43,937 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859)))) is different from true [2021-12-19 13:42:43,946 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9862))) (exists ((v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9861))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:43,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9864))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9863)))) is different from true [2021-12-19 13:42:43,964 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9866))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9865)))) is different from true [2021-12-19 13:42:43,973 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9867))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9868)))) is different from true [2021-12-19 13:42:44,003 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:44,033 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875)))) is different from true [2021-12-19 13:42:44,041 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2021-12-19 13:42:44,071 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:44,072 INFO L388 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 [2021-12-19 13:42:44,077 INFO L388 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 [2021-12-19 13:42:44,129 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:44,131 INFO L388 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 [2021-12-19 13:42:44,140 INFO L388 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 [2021-12-19 13:42:44,181 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:44,182 INFO L388 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 [2021-12-19 13:42:44,194 INFO L388 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 [2021-12-19 13:42:44,237 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:44,238 INFO L388 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 [2021-12-19 13:42:44,242 INFO L388 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 [2021-12-19 13:42:44,264 INFO L388 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 [2021-12-19 13:42:44,267 INFO L388 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 [2021-12-19 13:42:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2021-12-19 13:42:44,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:44,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:42:44,354 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))) is different from false [2021-12-19 13:42:44,392 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9881) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9882)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9881) .cse2 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:42:44,506 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9882))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9881) .cse1 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_9881) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_9882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_9883)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-19 13:42:44,596 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9880)) (.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9882))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9879) .cse0 v_ArrVal_9881) .cse1 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9880))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9879) .cse6 v_ArrVal_9881) (select (select (store .cse7 .cse6 v_ArrVal_9882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_9883))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-19 13:42:46,047 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9880))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9879) .cse2 v_ArrVal_9881) (select (select (store .cse3 .cse2 v_ArrVal_9882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9883)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_9880))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_9882))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_9879) .cse6 v_ArrVal_9881) .cse7 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-19 13:42:48,633 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9976)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9880))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9882))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9975) .cse0 v_ArrVal_9879) .cse1 v_ArrVal_9881) .cse2 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9976))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_9880))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9975) .cse8 v_ArrVal_9879) .cse9 v_ArrVal_9881) (select (select (store .cse10 .cse9 v_ArrVal_9882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11) v_ArrVal_9883))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11)))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32)))))) is different from false [2021-12-19 13:42:48,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1476707902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:48,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:42:48,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35] total 50 [2021-12-19 13:42:48,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278317846] [2021-12-19 13:42:48,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:42:48,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-19 13:42:48,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:42:48,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-19 13:42:48,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=189, Unknown=64, NotChecked=4028, Total=4422 [2021-12-19 13:42:48,656 INFO L87 Difference]: Start difference. First operand 1174 states and 1432 transitions. Second operand has 51 states, 49 states have (on average 2.836734693877551) internal successors, (139), 51 states have internal predecessors, (139), 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) [2021-12-19 13:42:50,454 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9794))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9196))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9793))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9197))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857)))) is different from true [2021-12-19 13:42:50,473 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859))) (exists ((v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9796))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9199))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_ArrVal_9795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9795))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9198))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854)))) is different from true [2021-12-19 13:42:50,492 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9797))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9862))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9810))) (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9798))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9809))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9861))) (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854)))) is different from true [2021-12-19 13:42:50,511 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9864))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9799))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9812))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9862))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9863))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9810))) (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9800))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9809))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9811))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9861))) (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854)))) is different from true [2021-12-19 13:42:50,530 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9814))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9864))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9812))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9862))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9863))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859))) (exists ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9866))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9810))) (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9865))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9802))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9809))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9811))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9801))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9861))) (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854))) (exists ((v_ArrVal_9813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9813)))) is different from true [2021-12-19 13:42:50,550 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9814))) (exists ((v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9209))) (exists ((v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9864))) (exists ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9876))) (exists ((v_ArrVal_9233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9233))) (exists ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9807))) (exists ((v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9858))) (exists ((v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9249))) (exists ((v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9816))) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_ArrVal_9812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9812))) (exists ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9275))) (exists ((v_ArrVal_9815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9815))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9862))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9847))) (exists ((v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9848))) (exists ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9868))) (exists ((v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9863))) (exists ((v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9859))) (exists ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9867))) (exists ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9866))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265))) (exists ((v_ArrVal_9810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9810))) (exists ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9860))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9857))) (exists ((v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9210))) (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232))) (exists ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9872))) (exists ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9211))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9805))) (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9865))) (exists ((v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9208))) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274))) (exists ((v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9248))) (exists ((v_ArrVal_9808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9808))) (exists ((v_ArrVal_9217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9217))) (exists ((v_ArrVal_9229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9229))) (exists ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9871))) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272))) (exists ((v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9806))) (exists ((v_ArrVal_9264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9264))) (exists ((v_ArrVal_9216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9216))) (exists ((v_ArrVal_9228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9228))) (exists ((v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9850))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200))) (exists ((v_ArrVal_9261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9261))) (exists ((v_ArrVal_9809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9809))) (exists ((v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9875))) (exists ((v_ArrVal_9811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9811))) (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273))) (exists ((v_ArrVal_9853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9853))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9241))) (exists ((v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9861))) (exists ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9849))) (exists ((v_ArrVal_9854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9854))) (exists ((v_ArrVal_9813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9813)))) is different from true [2021-12-19 13:42:50,565 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9878))) (exists ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9877))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9201))) (exists ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9200)))) is different from true [2021-12-19 13:43:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:43:14,203 INFO L93 Difference]: Finished difference Result 1180 states and 1438 transitions. [2021-12-19 13:43:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 13:43:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.836734693877551) internal successors, (139), 51 states have internal predecessors, (139), 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 126 [2021-12-19 13:43:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:43:14,205 INFO L225 Difference]: With dead ends: 1180 [2021-12-19 13:43:14,206 INFO L226 Difference]: Without dead ends: 1180 [2021-12-19 13:43:14,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 160 SyntacticMatches, 52 SemanticMatches, 81 ConstructedPredicates, 60 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=214, Invalid=452, Unknown=80, NotChecked=6060, Total=6806 [2021-12-19 13:43:14,206 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 789 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 4048 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 3110 SdHoareTripleChecker+Invalid, 43132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39068 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:43:14,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [793 Valid, 3110 Invalid, 43132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4048 Invalid, 0 Unknown, 39068 Unchecked, 24.0s Time] [2021-12-19 13:43:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-12-19 13:43:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1173. [2021-12-19 13:43:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 790 states have (on average 1.7544303797468355) internal successors, (1386), 1161 states have internal predecessors, (1386), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:43:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1431 transitions. [2021-12-19 13:43:14,219 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1431 transitions. Word has length 126 [2021-12-19 13:43:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:43:14,219 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1431 transitions. [2021-12-19 13:43:14,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.836734693877551) internal successors, (139), 51 states have internal predecessors, (139), 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) [2021-12-19 13:43:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1431 transitions. [2021-12-19 13:43:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-19 13:43:14,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:43:14,222 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:43:14,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2021-12-19 13:43:14,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2021-12-19 13:43:14,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:43:14,648 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:43:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:43:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -328528447, now seen corresponding path program 1 times [2021-12-19 13:43:14,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:43:14,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052726956] [2021-12-19 13:43:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:43:14,649 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:43:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:43:14,650 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:43:14,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-19 13:43:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:43:16,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:43:16,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:43:16,350 INFO L388 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 [2021-12-19 13:43:17,004 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:43:17,004 INFO L388 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 20 treesize of output 27 [2021-12-19 13:43:17,093 INFO L388 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 [2021-12-19 13:43:17,448 INFO L388 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 [2021-12-19 13:43:22,076 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_17| v_arrayElimCell_156)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_17|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_156)) (_ bv1 1))))) (exists ((v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10430)))) is different from true [2021-12-19 13:43:24,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:24,900 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:25,226 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:25,226 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:25,523 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:25,524 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:25,852 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:25,852 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:26,185 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:26,185 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:26,254 INFO L388 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 34 treesize of output 16 [2021-12-19 13:43:26,530 INFO L354 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2021-12-19 13:43:26,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2021-12-19 13:43:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:43:26,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:43:27,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10450) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10449))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10448))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10447))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:27,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10447))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:28,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10497))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10447)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:28,362 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:43:28,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052726956] [2021-12-19 13:43:28,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052726956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:43:28,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1716022241] [2021-12-19 13:43:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:43:28,363 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:43:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:43:28,364 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:43:28,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2021-12-19 13:43:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:43:43,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 13:43:43,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:43:43,892 INFO L388 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 [2021-12-19 13:43:44,554 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:43:44,554 INFO L388 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 20 treesize of output 27 [2021-12-19 13:43:44,609 INFO L388 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 [2021-12-19 13:43:44,805 INFO L388 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 [2021-12-19 13:43:54,867 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:54,867 INFO L388 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 50 treesize of output 49 [2021-12-19 13:43:55,155 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:55,155 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:55,320 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:55,320 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:55,494 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:55,494 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:55,678 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:43:55,678 INFO L388 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 37 treesize of output 38 [2021-12-19 13:43:55,747 INFO L388 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 34 treesize of output 16 [2021-12-19 13:43:55,967 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-19 13:43:55,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-19 13:43:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-19 13:43:56,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:43:56,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10971) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10970))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10970))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10969))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10970)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10969))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10970)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10968))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10969)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10970)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:56,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10968))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10969)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10970)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:43:57,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1716022241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:43:57,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:43:57,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-12-19 13:43:57,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856314982] [2021-12-19 13:43:57,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:43:57,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:43:57,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:43:57,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:43:57,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=284, Unknown=34, NotChecked=850, Total=1260 [2021-12-19 13:43:57,616 INFO L87 Difference]: Start difference. First operand 1173 states and 1431 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 16 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) [2021-12-19 13:44:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:44:06,080 INFO L93 Difference]: Finished difference Result 1179 states and 1437 transitions. [2021-12-19 13:44:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 13:44:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 16 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 130 [2021-12-19 13:44:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:44:06,083 INFO L225 Difference]: With dead ends: 1179 [2021-12-19 13:44:06,083 INFO L226 Difference]: Without dead ends: 1179 [2021-12-19 13:44:06,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 93 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=105, Invalid=347, Unknown=36, NotChecked=918, Total=1406 [2021-12-19 13:44:06,083 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 792 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2820 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:44:06,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 2518 Invalid, 4170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1333 Invalid, 0 Unknown, 2820 Unchecked, 8.0s Time] [2021-12-19 13:44:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2021-12-19 13:44:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1172. [2021-12-19 13:44:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 790 states have (on average 1.7531645569620253) internal successors, (1385), 1160 states have internal predecessors, (1385), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2021-12-19 13:44:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1430 transitions. [2021-12-19 13:44:06,093 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1430 transitions. Word has length 130 [2021-12-19 13:44:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:44:06,093 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 1430 transitions. [2021-12-19 13:44:06,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 16 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) [2021-12-19 13:44:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1430 transitions. [2021-12-19 13:44:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-19 13:44:06,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:44:06,094 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:44:06,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-12-19 13:44:06,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2021-12-19 13:44:06,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:44:06,501 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 532 more)] === [2021-12-19 13:44:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:44:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -328528446, now seen corresponding path program 1 times [2021-12-19 13:44:06,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:44:06,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957044121] [2021-12-19 13:44:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:44:06,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:44:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:44:06,503 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:44:06,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-19 13:44:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:44:08,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 125 conjunts are in the unsatisfiable core [2021-12-19 13:44:08,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:44:08,259 INFO L388 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 [2021-12-19 13:44:08,936 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:44:08,937 INFO L388 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 20 treesize of output 27 [2021-12-19 13:44:08,988 INFO L388 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 [2021-12-19 13:44:09,087 INFO L388 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 [2021-12-19 13:44:09,120 INFO L388 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 [2021-12-19 13:44:09,631 INFO L388 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 36 treesize of output 18 [2021-12-19 13:44:09,642 INFO L388 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 [2021-12-19 13:44:10,179 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11449))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11448)))) is different from true [2021-12-19 13:44:10,308 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11450))) (exists ((v_ArrVal_11451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11451))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32))))) is different from true [2021-12-19 13:44:10,676 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11455))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11454)))) is different from true [2021-12-19 13:44:10,821 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11457))) (exists ((v_ArrVal_11456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11456)))) is different from true [2021-12-19 13:44:10,961 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11458))) (exists ((v_ArrVal_11459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11459)))) is different from true [2021-12-19 13:44:11,288 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11463))) (exists ((v_ArrVal_11462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11462)))) is different from true [2021-12-19 13:44:11,415 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11464))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11465)))) is different from true [2021-12-19 13:44:12,291 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11474))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11475)))) is different from true [2021-12-19 13:44:12,430 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11477))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11476)))) is different from true [2021-12-19 13:44:12,938 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11482))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11483)))) is different from true [2021-12-19 13:44:13,648 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11491))) (exists ((v_ArrVal_11490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11490)))) is different from true [2021-12-19 13:44:13,783 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11493))) (exists ((v_ArrVal_11492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11492)))) is different from true [2021-12-19 13:44:15,437 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11510))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11511)))) is different from true [2021-12-19 13:44:15,757 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11515))) (exists ((v_ArrVal_11514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11514)))) is different from true [2021-12-19 13:44:16,081 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11518))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11519)))) is different from true [2021-12-19 13:44:16,212 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11520))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11521)))) is different from true [2021-12-19 13:44:16,340 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11522))) (exists ((v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11523)))) is different from true [2021-12-19 13:44:16,853 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11529))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11528)))) is different from true [2021-12-19 13:44:17,380 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11535))) (exists ((v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_11534)))) is different from true [2021-12-19 13:44:17,683 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:44:17,683 INFO L388 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 60 treesize of output 57 [2021-12-19 13:44:17,699 INFO L388 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 [2021-12-19 13:44:18,235 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:44:18,235 INFO L388 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 60 treesize of output 57 [2021-12-19 13:44:18,249 INFO L388 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 [2021-12-19 13:44:18,651 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:44:18,651 INFO L388 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 60 treesize of output 57 [2021-12-19 13:44:18,676 INFO L388 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 [2021-12-19 13:44:19,116 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:44:19,117 INFO L388 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 60 treesize of output 57 [2021-12-19 13:44:19,130 INFO L388 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 [2021-12-19 13:44:19,572 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:44:19,573 INFO L388 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 60 treesize of output 57 [2021-12-19 13:44:19,587 INFO L388 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 [2021-12-19 13:44:19,718 INFO L388 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 [2021-12-19 13:44:19,730 INFO L388 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 45 treesize of output 21 [2021-12-19 13:44:19,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:44:19,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-19 13:44:20,056 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-19 13:44:20,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2021-12-19 13:44:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 665 not checked. [2021-12-19 13:44:20,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:44:23,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_7| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_7|))) (and (forall ((v_ArrVal_11543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11544 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_7| v_ArrVal_11544) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11542) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))))) is different from false [2021-12-19 13:44:27,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_7| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_7|))) (and (forall ((v_ArrVal_11540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11539))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11538) .cse2 v_ArrVal_11541) (select (select (store .cse3 .cse2 v_ArrVal_11540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11542)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_11540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11544 (_ BitVec 32)) (v_ArrVal_11539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_11539))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_11540))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_11538) .cse6 v_ArrVal_11541) .cse7 v_ArrVal_11542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_7| v_ArrVal_11544) (select (select (store .cse9 .cse7 v_ArrVal_11543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))))) is different from false [2021-12-19 13:44:36,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_7| (_ BitVec 32))) (or (and (forall ((v_ArrVal_11540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11537))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11539))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11536) .cse2 v_ArrVal_11538) .cse3 v_ArrVal_11541) (select (select (store .cse4 .cse3 v_ArrVal_11540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11542)))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_11540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11544 (_ BitVec 32)) (v_ArrVal_11539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_11537))) (let ((.cse8 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse13 (store .cse14 .cse8 v_ArrVal_11539))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse12 (store .cse13 .cse9 v_ArrVal_11540))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_11536) .cse8 v_ArrVal_11538) .cse9 v_ArrVal_11541) .cse10 v_ArrVal_11542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_7| v_ArrVal_11544) (select (select (store .cse12 .cse10 v_ArrVal_11543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_7|))))) is different from false [2021-12-19 13:45:00,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:45:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957044121] [2021-12-19 13:45:00,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957044121] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:45:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1821545669] [2021-12-19 13:45:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:45:00,488 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:45:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:45:00,489 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:45:00,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2021-12-19 13:48:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:48:13,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 13:48:13,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:48:13,941 INFO L388 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 [2021-12-19 13:48:19,038 INFO L388 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 [2021-12-19 13:48:20,133 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:48:20,134 INFO L388 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 20 treesize of output 27 [2021-12-19 13:48:20,732 INFO L388 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 [2021-12-19 13:48:20,919 INFO L388 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 [2021-12-19 13:48:23,471 INFO L388 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 36 treesize of output 18 [2021-12-19 13:48:23,570 INFO L388 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 [2021-12-19 13:48:27,934 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12067))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12066)))) is different from true [2021-12-19 13:48:29,086 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12068))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12069)))) is different from true [2021-12-19 13:48:30,221 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12071))) (exists ((v_ArrVal_12070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12070)))) is different from true [2021-12-19 13:48:31,367 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12073))) (exists ((v_ArrVal_12072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12072)))) is different from true [2021-12-19 13:48:32,534 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12074))) (exists ((v_ArrVal_12075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12075)))) is different from true [2021-12-19 13:48:33,749 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12076))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12077)))) is different from true [2021-12-19 13:48:34,915 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12079))) (exists ((v_ArrVal_12078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12078)))) is different from true [2021-12-19 13:48:36,086 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12080))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12081)))) is different from true [2021-12-19 13:48:37,291 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12083))) (exists ((v_ArrVal_12082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12082)))) is different from true [2021-12-19 13:48:38,506 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12084))) (exists ((v_ArrVal_12085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12085)))) is different from true [2021-12-19 13:48:39,726 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12086))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12087)))) is different from true [2021-12-19 13:48:40,934 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12088 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12088))) (exists ((v_ArrVal_12089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12089)))) is different from true [2021-12-19 13:48:42,110 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12090))) (exists ((v_ArrVal_12091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12091)))) is different from true [2021-12-19 13:48:43,287 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12093))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12092)))) is different from true [2021-12-19 13:48:44,460 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12095 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12095))) (exists ((v_ArrVal_12094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12094))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32))))) is different from true [2021-12-19 13:48:45,608 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12097))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12096 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12096)))) is different from true [2021-12-19 13:48:46,768 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12099))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12098)))) is different from true [2021-12-19 13:48:47,904 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12101 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12101))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12100)))) is different from true [2021-12-19 13:48:49,059 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12102 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12102))) (exists ((v_ArrVal_12103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12103)))) is different from true [2021-12-19 13:48:50,200 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12104))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12105)))) is different from true [2021-12-19 13:48:51,342 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12107))) (exists ((v_ArrVal_12106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12106)))) is different from true [2021-12-19 13:48:52,493 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12109 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12109))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12108)))) is different from true [2021-12-19 13:48:53,641 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12110))) (exists ((v_ArrVal_12111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12111)))) is different from true [2021-12-19 13:48:54,791 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12112))) (exists ((v_ArrVal_12113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12113)))) is different from true [2021-12-19 13:48:55,951 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12114))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12115)))) is different from true [2021-12-19 13:48:57,097 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12117))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12116)))) is different from true [2021-12-19 13:48:58,244 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12119))) (exists ((v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12118)))) is different from true [2021-12-19 13:48:59,412 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12121))) (exists ((v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12120)))) is different from true [2021-12-19 13:49:00,561 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12122))) (exists ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12123)))) is different from true [2021-12-19 13:49:01,725 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12124 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12124))) (exists ((v_ArrVal_12125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12125)))) is different from true [2021-12-19 13:49:02,889 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12127))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12126)))) is different from true [2021-12-19 13:49:04,024 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12128))) (exists ((v_ArrVal_12129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12129))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32))))) is different from true [2021-12-19 13:49:05,163 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12131))) (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12130)))) is different from true [2021-12-19 13:49:06,316 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12133))) (exists ((v_ArrVal_12132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12132)))) is different from true [2021-12-19 13:49:07,483 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_179 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19|))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_19| v_arrayElimCell_179)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_179)) (_ bv1 1))) (= (select |c_#length| v_arrayElimCell_179) (_ bv44 32)))) (exists ((v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12135))) (exists ((v_ArrVal_12134 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_12134)))) is different from true Killed by 15